| title | type |
|---|---|
Dynamic Programming |
docs |
| Title | Solution | Difficulty | Time | Space | 收藏 |
|---|---|---|---|---|---|
| 53. Maximum Subarray | [Go]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}}) | Easy | O(n) | O(n) | |
| 62. Unique Paths | [Go]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}}) | Medium | O(n^2) | O(n^2) | |
| 63. Unique Paths II | [Go]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}}) | Medium | O(n^2) | O(n^2) | |
| 64. Minimum Path Sum | [Go]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}}) | Medium | O(n^2) | O(n^2) | |
| 70. Climbing Stairs | [Go]({{< relref "/ChapterFour/0070.Climbing-Stairs.md" >}}) | Easy | O(n) | O(n) | |
| 91. Decode Ways | [Go]({{< relref "/ChapterFour/0091.Decode-Ways.md" >}}) | Medium | O(n) | O(n) | |
| 96. Unique Binary Search Trees | [Go]({{< relref "/ChapterFour/0096.Unique-Binary-Search-Trees.md" >}}) | Medium | O(n) | O(n) | |
| 120. Triangle | [Go]({{< relref "/ChapterFour/0120.Triangle.md" >}}) | Medium | O(n^2) | O(n) | |
| 121. Best Time to Buy and Sell Stock | [Go]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}}) | Easy | O(n) | O(1) | |
| 152. Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.md" >}}) | Medium | O(n) | O(1) | |
| 198. House Robber | [Go]({{< relref "/ChapterFour/0198.House-Robber.md" >}}) | Easy | O(n) | O(n) | |
| 213. House Robber II | [Go]({{< relref "/ChapterFour/0213.House-Robber-II.md" >}}) | Medium | O(n) | O(n) | |
| 300. Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}}) | Medium | O(n log n) | O(n) | |
| 309. Best Time to Buy and Sell Stock with Cooldown | [Go]({{< relref "/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}}) | Medium | O(n) | O(n) | |
| 322. Coin Change | [Go]({{< relref "/ChapterFour/0322.Coin-Change.md" >}}) | Medium | O(n) | O(n) | |
| 338. Counting Bits | [Go]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}}) | Medium | O(n) | O(n) | |
| 343. Integer Break | [Go]({{< relref "/ChapterFour/0343.Integer-Break.md" >}}) | Medium | O(n^2) | O(n) | |
| 357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}}) | Medium | O(1) | O(1) | |
| 392. Is Subsequence | [Go]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}}) | Medium | O(n) | O(1) | |
| 416. Partition Equal Subset Sum | [Go]({{< relref "/ChapterFour/0416.Partition-Equal-Subset-Sum.md" >}}) | Medium | O(n^2) | O(n) | |
| 714. Best Time to Buy and Sell Stock with Transaction Fee | [Go]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}}) | Medium | O(n) | O(1) | |
| 746. Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}}) | Easy | O(n) | O(1) | |
| 838. Push Dominoes | [Go]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}}) | Medium | O(n) | O(n) | |
| 1025. Divisor Game | [Go]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}}) | Easy | O(1) | O(1) | |
| 891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}}) | Hard | O(n log n) | O(1) | |
| 942. DI String Match | [Go]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}}) | Easy | O(n) | O(1) | |
| --------------------------------------- | --------------------------------- | -------------------------- | ----------------------- | ----------- | -------- |