mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-14 16:14:52 +08:00
7.2 KiB
7.2 KiB
| title | type | weight |
|---|---|---|
| 2.07 Dynamic Programming | docs | 7 |
Dynamic Programming
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity | Favorite | Acceptance |
|---|---|---|---|---|---|---|---|
| 0042 | Trapping Rain Water | [Go]({{< relref "/ChapterFour/0000~0099/0042.Trapping-Rain-Water.md" >}}) | Hard | 50.9% | |||
| 0053 | Maximum Subarray | [Go]({{< relref "/ChapterFour/0000~0099/0053.Maximum-Subarray.md" >}}) | Easy | O(n) | O(n) | 47.6% | |
| 0062 | Unique Paths | [Go]({{< relref "/ChapterFour/0000~0099/0062.Unique-Paths.md" >}}) | Medium | O(n^2) | O(n^2) | 55.7% | |
| 0063 | Unique Paths II | [Go]({{< relref "/ChapterFour/0000~0099/0063.Unique-Paths-II.md" >}}) | Medium | O(n^2) | O(n^2) | 35.2% | |
| 0064 | Minimum Path Sum | [Go]({{< relref "/ChapterFour/0000~0099/0064.Minimum-Path-Sum.md" >}}) | Medium | O(n^2) | O(n^2) | 56.0% | |
| 0070 | Climbing Stairs | [Go]({{< relref "/ChapterFour/0000~0099/0070.Climbing-Stairs.md" >}}) | Easy | O(n) | O(n) | 48.5% | |
| 0091 | Decode Ways | [Go]({{< relref "/ChapterFour/0000~0099/0091.Decode-Ways.md" >}}) | Medium | O(n) | O(n) | 26.3% | |
| 0095 | Unique Binary Search Trees II | [Go]({{< relref "/ChapterFour/0000~0099/0095.Unique-Binary-Search-Trees-II.md" >}}) | Medium | 42.2% | |||
| 0096 | Unique Binary Search Trees | [Go]({{< relref "/ChapterFour/0000~0099/0096.Unique-Binary-Search-Trees.md" >}}) | Medium | O(n) | O(n) | 54.2% | |
| 0120 | Triangle | [Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}}) | Medium | O(n^2) | O(n) | 45.6% | |
| 0121 | Best Time to Buy and Sell Stock | [Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}}) | Easy | O(n) | O(1) | 51.4% | |
| 0131 | Palindrome Partitioning | [Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}}) | Medium | 51.5% | |||
| 0152 | Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md" >}}) | Medium | O(n) | O(1) | 32.7% | |
| 0174 | Dungeon Game | [Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}}) | Hard | 33.2% | |||
| 0198 | House Robber | [Go]({{< relref "/ChapterFour/0100~0199/0198.House-Robber.md" >}}) | Medium | O(n) | O(n) | 42.8% | |
| 0213 | House Robber II | [Go]({{< relref "/ChapterFour/0200~0299/0213.House-Robber-II.md" >}}) | Medium | O(n) | O(n) | 37.4% | |
| 0300 | Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}}) | Medium | O(n log n) | O(n) | 43.7% | |
| 0303 | Range Sum Query - Immutable | [Go]({{< relref "/ChapterFour/0300~0399/0303.Range-Sum-Query---Immutable.md" >}}) | Easy | 47.2% | |||
| 0309 | Best Time to Buy and Sell Stock with Cooldown | [Go]({{< relref "/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}}) | Medium | O(n) | O(n) | 48.1% | |
| 0322 | Coin Change | [Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}}) | Medium | O(n) | O(n) | 37.0% | |
| 0337 | House Robber III | [Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}}) | Medium | 51.8% | |||
| 0338 | Counting Bits | [Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}}) | Medium | O(n) | O(n) | 70.3% | |
| 0343 | Integer Break | [Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}}) | Medium | O(n^2) | O(n) | 51.1% | |
| 0354 | Russian Doll Envelopes | [Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}}) | Hard | 36.1% | |||
| 0357 | Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}}) | Medium | O(1) | O(1) | 48.8% | |
| 0392 | Is Subsequence | [Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}}) | Easy | O(n) | O(1) | 49.5% | |
| 0410 | Split Array Largest Sum | [Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}}) | Hard | 46.2% | |||
| 0416 | Partition Equal Subset Sum | [Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}}) | Medium | O(n^2) | O(n) | 44.8% | |
| 0474 | Ones and Zeroes | [Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}}) | Medium | 43.5% | |||
| 0494 | Target Sum | [Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}}) | Medium | 45.8% | |||
| 0638 | Shopping Offers | [Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}}) | Medium | 52.7% | |||
| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}}) | Medium | O(n) | O(1) | 55.9% | |
| 0718 | Maximum Length of Repeated Subarray | [Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}}) | Medium | 50.2% | |||
| 0746 | Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}}) | Easy | O(n) | O(1) | 50.9% | |
| 0838 | Push Dominoes | [Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}}) | Medium | O(n) | O(n) | 49.7% | |
| 0887 | Super Egg Drop | [Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}}) | Hard | 27.0% | |||
| 0898 | Bitwise ORs of Subarrays | [Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}}) | Medium | 34.0% | |||
| 0920 | Number of Music Playlists | [Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}}) | Hard | 47.7% | |||
| 0968 | Binary Tree Cameras | [Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}}) | Hard | 38.5% | |||
| 0978 | Longest Turbulent Subarray | [Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}}) | Medium | 46.6% | |||
| 1025 | Divisor Game | [Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}}) | Easy | O(1) | O(1) | 66.1% | |
| 1049 | Last Stone Weight II | [Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}}) | Medium | 45.1% | |||
| 1074 | Number of Submatrices That Sum to Target | [Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}}) | Hard | 61.5% | |||
| 1105 | Filling Bookcase Shelves | [Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}}) | Medium | 57.6% | |||
| 1235 | Maximum Profit in Job Scheduling | [Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}}) | Hard | 47.1% | |||
| 1463 | Cherry Pickup II | [Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}}) | Hard | 69.4% | |||
| 1641 | Count Sorted Vowel Strings | [Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}}) | Medium | 77.2% | |||
| 1654 | Minimum Jumps to Reach Home | [Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}}) | Medium | 26.2% | |||
| 1655 | Distribute Repeating Integers | [Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}}) | Hard | 40.4% | |||
| 1659 | Maximize Grid Happiness | [Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}}) | Hard | 35.3% | |||
| 1664 | Ways to Make a Fair Array | [Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}}) | Medium | 60.6% | |||
| 1690 | Stone Game VII | [Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}}) | Medium | 47.1% | |||
| ------------ | ------------------------------------------------------- | ------- | ---------------- | --------------- | ------------- | ------------- | ------------- |