用户6318060069727

84. Largest Rectangle in Histogram Given an array of integers heights representing the...

503. Next Greater Element II Given a circular integer array nums (i.e., the next eleme...

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

647. Palindromic Substrings Given a string s, return the number of palindromic substri...

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

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

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

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

309. Best Time to Buy and Sell Stock with Cooldow You are given an array prices where ...

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

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

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

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

70. Climbing Stairs You are climbing a staircase. It takes n steps to reach the top. E...

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

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

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

343. Integer Break Given an integer n, break it into the sum of k positive integers, w...

62. Unique Paths There is a robot on an m x n grid. The robot is initially located at ...

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