mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-15 00:22:40 +08:00
8.4 KiB
8.4 KiB
title | type | weight |
---|---|---|
2.07 Dynamic Programming | docs | 7 |
Dynamic Programming
No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity | Favorite | Acceptance |
---|---|---|---|---|---|---|---|
0005 | Longest Palindromic Substring | [Go]({{< relref "/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md" >}}) | Medium | 30.6% | |||
0032 | Longest Valid Parentheses | [Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}}) | Hard | 29.9% | |||
0042 | Trapping Rain Water | [Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}}) | Hard | 51.6% | |||
0053 | Maximum Subarray | [Go]({{< relref "/ChapterFour/0001~0099/0053.Maximum-Subarray.md" >}}) | Easy | O(n) | O(n) | 47.9% | |
0062 | Unique Paths | [Go]({{< relref "/ChapterFour/0001~0099/0062.Unique-Paths.md" >}}) | Medium | O(n^2) | O(n^2) | 56.3% | |
0063 | Unique Paths II | [Go]({{< relref "/ChapterFour/0001~0099/0063.Unique-Paths-II.md" >}}) | Medium | O(n^2) | O(n^2) | 35.4% | |
0064 | Minimum Path Sum | [Go]({{< relref "/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md" >}}) | Medium | O(n^2) | O(n^2) | 56.5% | |
0070 | Climbing Stairs | [Go]({{< relref "/ChapterFour/0001~0099/0070.Climbing-Stairs.md" >}}) | Easy | O(n) | O(n) | 48.8% | |
0091 | Decode Ways | [Go]({{< relref "/ChapterFour/0001~0099/0091.Decode-Ways.md" >}}) | Medium | O(n) | O(n) | 26.9% | |
0095 | Unique Binary Search Trees II | [Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}}) | Medium | 43.0% | |||
0096 | Unique Binary Search Trees | [Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}}) | Medium | O(n) | O(n) | 54.7% | |
0115 | Distinct Subsequences | [Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}}) | Hard | 40.0% | |||
0120 | Triangle | [Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}}) | Medium | O(n^2) | O(n) | 46.1% | |
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.8% | |
0131 | Palindrome Partitioning | [Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}}) | Medium | 52.6% | |||
0152 | Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md" >}}) | Medium | O(n) | O(1) | 32.9% | |
0174 | Dungeon Game | [Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}}) | Hard | 33.4% | |||
0198 | House Robber | [Go]({{< relref "/ChapterFour/0100~0199/0198.House-Robber.md" >}}) | Medium | O(n) | O(n) | 43.1% | |
0213 | House Robber II | [Go]({{< relref "/ChapterFour/0200~0299/0213.House-Robber-II.md" >}}) | Medium | O(n) | O(n) | 37.7% | |
0300 | Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}}) | Medium | O(n log n) | O(n) | 44.5% | |
0303 | Range Sum Query - Immutable | [Go]({{< relref "/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md" >}}) | Easy | 48.2% | |||
0304 | Range Sum Query 2D - Immutable | [Go]({{< relref "/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md" >}}) | Medium | 41.1% | |||
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.4% | |
0322 | Coin Change | [Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}}) | Medium | O(n) | O(n) | 37.7% | |
0337 | House Robber III | [Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}}) | Medium | 52.0% | |||
0338 | Counting Bits | [Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}}) | Medium | O(n) | O(n) | 70.6% | |
0343 | Integer Break | [Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}}) | Medium | O(n^2) | O(n) | 51.4% | |
0354 | Russian Doll Envelopes | [Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}}) | Hard | 37.7% | |||
0357 | Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}}) | Medium | O(1) | O(1) | 49.0% | |
0376 | Wiggle Subsequence | [Go]({{< relref "/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md" >}}) | Medium | 42.2% | |||
0392 | Is Subsequence | [Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}}) | Easy | O(n) | O(1) | 49.6% | |
0410 | Split Array Largest Sum | [Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}}) | Hard | 46.7% | |||
0413 | Arithmetic Slices | [Go]({{< relref "/ChapterFour/0400~0499/0413.Arithmetic-Slices.md" >}}) | Medium | 60.0% | |||
0416 | Partition Equal Subset Sum | [Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}}) | Medium | O(n^2) | O(n) | 45.0% | |
0474 | Ones and Zeroes | [Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}}) | Medium | 44.0% | |||
0494 | Target Sum | [Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}}) | Medium | 45.6% | |||
0638 | Shopping Offers | [Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}}) | Medium | 53.1% | |||
0647 | Palindromic Substrings | [Go]({{< relref "/ChapterFour/0600~0699/0647.Palindromic-Substrings.md" >}}) | Medium | 62.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) | 58.1% | |
0718 | Maximum Length of Repeated Subarray | [Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}}) | Medium | 50.5% | |||
0746 | Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}}) | Easy | O(n) | O(1) | 51.0% | |
0838 | Push Dominoes | [Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}}) | Medium | O(n) | O(n) | 50.0% | |
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.5% | |||
0920 | Number of Music Playlists | [Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}}) | Hard | 48.0% | |||
0968 | Binary Tree Cameras | [Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}}) | Hard | 38.9% | |||
0978 | Longest Turbulent Subarray | [Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}}) | Medium | 46.7% | |||
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.9% | |||
1074 | Number of Submatrices That Sum to Target | [Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}}) | Hard | 62.0% | |||
1105 | Filling Bookcase Shelves | [Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}}) | Medium | 57.5% | |||
1143 | Longest Common Subsequence | [Go]({{< relref "/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md" >}}) | Medium | 58.7% | |||
1235 | Maximum Profit in Job Scheduling | [Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}}) | Hard | 47.7% | |||
1423 | Maximum Points You Can Obtain from Cards | [Go]({{< relref "/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md" >}}) | Medium | 46.9% | |||
1463 | Cherry Pickup II | [Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}}) | Hard | 68.8% | |||
1641 | Count Sorted Vowel Strings | [Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}}) | Medium | 75.7% | |||
1654 | Minimum Jumps to Reach Home | [Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}}) | Medium | 25.3% | |||
1655 | Distribute Repeating Integers | [Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}}) | Hard | 40.0% | |||
1659 | Maximize Grid Happiness | [Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}}) | Hard | 35.6% | |||
1664 | Ways to Make a Fair Array | [Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}}) | Medium | 62.1% | |||
1690 | Stone Game VII | [Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}}) | Medium | 49.1% | |||
1691 | Maximum Height by Stacking Cuboids | [Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}}) | Hard | 50.1% | |||
------------ | ------------------------------------------------------- | ------- | ---------------- | --------------- | ------------- | ------------- | ------------- |