刷题打卡

84. Largest Rectangle in Histogram Given an array of integers heights representing the histogram's b

503. Next Greater Element II Given a circular integer array nums (i.e., the next element of nums[num

739. Daily Temperatures Given an array of integers temperatures represents the daily temperatures, r

647. Palindromic Substrings Given a string s, return the number of palindromic substrings in it. A s

583. Delete Operation for Two Strings Given two strings word1 and word2, return the minimum number o

392. Is Subsequence Given two strings s and t, return true if s is a subsequence of t , or false oth

1143. Longest Common Subsequence Given two strings text1 and text2, return the length of their longe

300. Longest Increasing Subsequence Given an integer array nums, return the length of the longest st

309. Best Time to Buy and Sell Stock with Cooldow You are given an array prices where prices[i] is t

123. Best Time to Buy and Sell Stock III You are given an array prices where prices[i] is the price

121. Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a

198. House Robber You are a professional robber planning to rob houses along a street. Each house ha

139. Word Break Given a string s and a dictionary of strings wordDict, return true if s can be segme

70. Climbing Stairs You are climbing a staircase. It takes n steps to reach the top. Each time you c

518. Coin Change II You are given an integer array coins representing coins of different denominatio

1049. Last Stone Weight II You are given an array of integers stones where stones[i] is the weight o

背包问题 对于面试的话，其实掌握01背包，和完全背包，就够用了，最多可以再来一个多重背包。 416. Partition Equal Subset Sum Given an integer array

343. Integer Break Given an integer n, break it into the sum of k positive integers, where k >= 2, a

62. Unique Paths There is a robot on an m x n grid. The robot is initially located at the top-left c

509. Fibonacci Number The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibon