首页
沸点
课程
AI Coding
数据标注
更多
直播
活动
APP
插件
直播
活动
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
登录
注册
刷题打卡
用户6318060069727
创建于2023-07-26
订阅专栏
代码随想录-训练营打卡
暂无订阅
共52篇文章
创建于2023-07-26
订阅专栏
默认顺序
默认顺序
最早发布
最新发布
第十章 单调栈part03
84. Largest Rectangle in Histogram Given an array of integers heights representing the histogram's b
第十章 单调栈part02
503. Next Greater Element II Given a circular integer array nums (i.e., the next element of nums[num
第十章 单调栈part01
739. Daily Temperatures Given an array of integers temperatures represents the daily temperatures, r
第九章 动态规划part17
647. Palindromic Substrings Given a string s, return the number of palindromic substrings in it. A s
第九章 动态规划part16
583. Delete Operation for Two Strings Given two strings word1 and word2, return the minimum number o
第九章 动态规划part15
392. Is Subsequence Given two strings s and t, return true if s is a subsequence of t , or false oth
第九章 动态规划part14
1143. Longest Common Subsequence Given two strings text1 and text2, return the length of their longe
第九章 动态规划part13
300. Longest Increasing Subsequence Given an integer array nums, return the length of the longest st
第九章 动态规划part12
309. Best Time to Buy and Sell Stock with Cooldow You are given an array prices where prices[i] is t
第九章 动态规划part11
123. Best Time to Buy and Sell Stock III You are given an array prices where prices[i] is the price
第九章 动态规划part10
121. Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a
第九章 动态规划part09
198. House Robber You are a professional robber planning to rob houses along a street. Each house ha
第九章 动态规划part08
139. Word Break Given a string s and a dictionary of strings wordDict, return true if s can be segme
第九章 动态规划part07
70. Climbing Stairs You are climbing a staircase. It takes n steps to reach the top. Each time you c
第九章 动态规划part06
518. Coin Change II You are given an integer array coins representing coins of different denominatio
第九章 动态规划 part05
1049. Last Stone Weight II You are given an array of integers stones where stones[i] is the weight o
第九章 动态规划part04
背包问题 对于面试的话,其实掌握01背包,和完全背包,就够用了,最多可以再来一个多重背包。 416. Partition Equal Subset Sum Given an integer array
第九章 动态规划part03
343. Integer Break Given an integer n, break it into the sum of k positive integers, where k >= 2, a
第九章 动态规划part02
62. Unique Paths There is a robot on an m x n grid. The robot is initially located at the top-left c
第九章 动态规划part01
509. Fibonacci Number The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibon
下一页