Skip to content

Latest commit

 

History

History
42 lines (38 loc) · 3.4 KB

File metadata and controls

42 lines (38 loc) · 3.4 KB
title type
Sort
docs

Sort

  • 深刻的理解多路快排。第 75 题。
  • 链表的排序,插入排序(第 147 题)和归并排序(第 148 题)
  • 桶排序和基数排序。第 164 题。
  • "摆动排序"。第 324 题。
  • 两两不相邻的排序。第 767 题,第 1054 题。
  • "饼子排序"。第 969 题。
Title Solution Difficulty Time Space 收藏
56. Merge Intervals [Go]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}}) Medium O(n log n) O(log n)
57. Insert Interval [Go]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}}) Hard O(n) O(1)
75. Sort Colors [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}}) Medium O(n) O(1) ❤️
147. Insertion Sort List [Go]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}}) Medium O(n) O(1) ❤️
148. Sort List [Go]({{< relref "/ChapterFour/0148.Sort-List.md" >}}) Medium O(n log n) O(log n) ❤️
164. Maximum Gap [Go]({{< relref "/ChapterFour/0164.Maximum-Gap.md" >}}) Hard O(n log n) O(log n) ❤️
179. Largest Number [Go]({{< relref "/ChapterFour/0179.Largest-Number.md" >}}) Medium O(n log n) O(log n) ❤️
220. Contains Duplicate III [Go]({{< relref "/ChapterFour/0220.Contains-Duplicate-III.md" >}}) Medium O(n log n) O(1) ❤️
242. Valid Anagram [Go]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}}) Easy O(n) O(n)
274. H-Index [Go]({{< relref "/ChapterFour/0274.H-Index.md" >}}) Medium O(n) O(n)
324. Wiggle Sort II [Go]({{< relref "/ChapterFour/0324.Wiggle-Sort-II.md" >}}) Medium O(n) O(n) ❤️
349. Intersection of Two Arrays [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}}) Easy O(n) O(n)
350. Intersection of Two Arrays II [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}}) Easy O(n) O(n)
524. Longest Word in Dictionary through Deleting [Go]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}}) Medium O(n) O(1)
767. Reorganize String [Go]({{< relref "/ChapterFour/0767.Reorganize-String.md" >}}) Medium O(n log n) O(log n) ❤️
853. Car Fleet [Go]({{< relref "/ChapterFour/0853.Car-Fleet.md" >}}) Medium O(n log n) O(log n)
710. Random Pick with Blacklist [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}}) Hard O(n) O(n)
922. Sort Array By Parity II [Go]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}}) Easy O(n) O(1)
969. Pancake Sorting [Go]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}}) Medium O(n log n) O(log n) ❤️
973. K Closest Points to Origin [Go]({{< relref "/ChapterFour/0973.K-Closest-Points-to-Origin.md" >}}) Medium O(n log n) O(log n)
976. Largest Perimeter Triangle [Go]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}}) Easy O(n log n) O(log n)
1030. Matrix Cells in Distance Order [Go]({{< relref "/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md" >}}) Easy O(n^2) O(1)
1054. Distant Barcodes [Go]({{< relref "/ChapterFour/1054.Distant-Barcodes.md" >}}) Medium O(n log n) O(log n) ❤️
--------------------------------------- --------------------------------- -------------------------- ----------------------- ----------- --------