Dynamic Programming

Dynamic Programming #

TitleSolutionDifficultyTimeSpace收藏
53. Maximum SubarrayGoEasyO(n)O(n)
62. Unique PathsGoMediumO(n^2)O(n^2)
63. Unique Paths IIGoMediumO(n^2)O(n^2)
64. Minimum Path SumGoMediumO(n^2)O(n^2)
70. Climbing StairsGoEasyO(n)O(n)
91. Decode WaysGoMediumO(n)O(n)
96. Unique Binary Search TreesGoMediumO(n)O(n)
120. TriangleGoMediumO(n^2)O(n)
121. Best Time to Buy and Sell StockGoEasyO(n)O(1)
152. Maximum Product SubarrayGoMediumO(n)O(1)
198. House RobberGoEasyO(n)O(n)
213. House Robber IIGoMediumO(n)O(n)
300. Longest Increasing SubsequenceGoMediumO(n log n)O(n)
309. Best Time to Buy and Sell Stock with CooldownGoMediumO(n)O(n)
322. Coin ChangeGoMediumO(n)O(n)
338. Counting BitsGoMediumO(n)O(n)
343. Integer BreakGoMediumO(n^2)O(n)
357. Count Numbers with Unique DigitsGoMediumO(1)O(1)
392. Is SubsequenceGoMediumO(n)O(1)
416. Partition Equal Subset SumGoMediumO(n^2)O(n)
714. Best Time to Buy and Sell Stock with Transaction FeeGoMediumO(n)O(1)
746. Min Cost Climbing StairsGoEasyO(n)O(1)
838. Push DominoesGoMediumO(n)O(n)
1025. Divisor GameGoEasyO(1)O(1)
891. Sum of Subsequence WidthsGoHardO(n log n)O(1)
942. DI String MatchGoEasyO(n)O(1)
————————————————————————————————–———————–———–——–

⬅️上一页

下一页➡️

Calendar Sep 6, 2020
Edit Edit this page
本站总访问量:  次 您是本站第  位访问者