mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-24 02:14:00 +08:00
5.1 KiB
5.1 KiB
| title | type |
|---|---|
| Sort | docs |
Sort
- 深刻的理解多路快排。第 75 题。
- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
- 桶排序和基数排序。第 164 题。
- "摆动排序"。第 324 题。
- 两两不相邻的排序。第 767 题，第 1054 题。
- "饼子排序"。第 969 题。
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity | Favorite | Acceptance |
|---|---|---|---|---|---|---|---|
| 0056 | Merge Intervals | [Go]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}}) | Medium | O(n log n) | O(log n) | 40.7% | |
| 0057 | Insert Interval | [Go]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}}) | Medium | O(n) | O(1) | 34.9% | |
| 0075 | Sort Colors | [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}}) | Medium | O(n) | O(1) | ❤️ | 49.0% |
| 0147 | Insertion Sort List | [Go]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}}) | Medium | O(n) | O(1) | ❤️ | 44.2% |
| 0148 | Sort List | [Go]({{< relref "/ChapterFour/0148.Sort-List.md" >}}) | Medium | O(n log n) | O(log n) | ❤️ | 45.9% |
| 0164 | Maximum Gap | [Go]({{< relref "/ChapterFour/0164.Maximum-Gap.md" >}}) | Hard | O(n log n) | O(log n) | ❤️ | 36.6% |
| 0179 | Largest Number | [Go]({{< relref "/ChapterFour/0179.Largest-Number.md" >}}) | Medium | O(n log n) | O(log n) | ❤️ | 30.5% |
| 0220 | Contains Duplicate III | [Go]({{< relref "/ChapterFour/0220.Contains-Duplicate-III.md" >}}) | Medium | O(n log n) | O(1) | ❤️ | 21.3% |
| 0242 | Valid Anagram | [Go]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}}) | Easy | O(n) | O(n) | 58.0% | |
| 0274 | H-Index | [Go]({{< relref "/ChapterFour/0274.H-Index.md" >}}) | Medium | O(n) | O(n) | 36.3% | |
| 0315 | Count of Smaller Numbers After Self | [Go]({{< relref "/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md" >}}) | Hard | 42.6% | |||
| 0324 | Wiggle Sort II | [Go]({{< relref "/ChapterFour/0324.Wiggle-Sort-II.md" >}}) | Medium | O(n) | O(n) | ❤️ | 30.6% |
| 0327 | Count of Range Sum | [Go]({{< relref "/ChapterFour/0327.Count-of-Range-Sum.md" >}}) | Hard | 35.9% | |||
| 0349 | Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}}) | Easy | O(n) | O(n) | 64.5% | |
| 0350 | Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}}) | Easy | O(n) | O(n) | 51.9% | |
| 0493 | Reverse Pairs | [Go]({{< relref "/ChapterFour/0493.Reverse-Pairs.md" >}}) | Hard | 26.6% | |||
| 0524 | Longest Word in Dictionary through Deleting | [Go]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}}) | Medium | O(n) | O(1) | 48.9% | |
| 0710 | Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}}) | Hard | O(n) | O(n) | 32.6% | |
| 0767 | Reorganize String | [Go]({{< relref "/ChapterFour/0767.Reorganize-String.md" >}}) | Medium | O(n log n) | O(log n) | ❤️ | 49.9% |
| 0853 | Car Fleet | [Go]({{< relref "/ChapterFour/0853.Car-Fleet.md" >}}) | Medium | O(n log n) | O(log n) | 43.6% | |
| 0922 | Sort Array By Parity II | [Go]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}}) | Easy | O(n) | O(1) | 70.4% | |
| 0969 | Pancake Sorting | [Go]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}}) | Medium | O(n log n) | O(log n) | ❤️ | 68.6% |
| 0973 | K Closest Points to Origin | [Go]({{< relref "/ChapterFour/0973.K-Closest-Points-to-Origin.md" >}}) | Medium | O(n log n) | O(log n) | 64.5% | |
| 0976 | Largest Perimeter Triangle | [Go]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}}) | Easy | O(n log n) | O(log n) | 58.5% | |
| 1030 | Matrix Cells in Distance Order | [Go]({{< relref "/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md" >}}) | Easy | O(n^2) | O(1) | 66.9% | |
| 1054 | Distant Barcodes | [Go]({{< relref "/ChapterFour/1054.Distant-Barcodes.md" >}}) | Medium | O(n log n) | O(log n) | ❤️ | 44.2% |
| 1122 | Relative Sort Array | [Go]({{< relref "/ChapterFour/1122.Relative-Sort-Array.md" >}}) | Easy | 67.9% | |||
| 1235 | Maximum Profit in Job Scheduling | [Go]({{< relref "/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md" >}}) | Hard | 47.0% | |||
| 1305 | All Elements in Two Binary Search Trees | [Go]({{< relref "/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}}) | Medium | 77.8% | |||
| 1329 | Sort the Matrix Diagonally | [Go]({{< relref "/ChapterFour/1329.Sort-the-Matrix-Diagonally.md" >}}) | Medium | 81.8% | |||
| 1640 | Check Array Formation Through Concatenation | [Go]({{< relref "/ChapterFour/1640.Check-Array-Formation-Through-Concatenation.md" >}}) | Easy | 60.7% | |||
| 1647 | Minimum Deletions to Make Character Frequencies Unique | [Go]({{< relref "/ChapterFour/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}}) | Medium | 53.9% | |||
| 1648 | Sell Diminishing-Valued Colored Balls | [Go]({{< relref "/ChapterFour/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}}) | Medium | 30.9% | |||
| ------------ | ------------------------------------------------------- | ------- | ---------------- | --------------- | ------------- | ------------- | ------------- |