Array

Array #

TitleSolutionDifficultyTimeSpace收藏
1. Two SumGoEasyO(n)O(n)
11. Container With Most WaterGoMediumO(n)O(1)
15. 3SumGoMediumO(n^2)O(n)❤️
16. 3Sum ClosestGoMediumO(n^2)O(1)❤️
18. 4SumGoMediumO(n^3)O(n^2)❤️
26. Remove Duplicates from Sorted ArrayGoEasyO(n)O(1)
27. Remove ElementGoEasyO(n)O(1)
39. Combination SumGoMediumO(n log n)O(n)
40. Combination Sum IIGoMediumO(n log n)O(n)
41. First Missing PositiveGoHardO(n)O(n)
42. Trapping Rain WaterGoHardO(n)O(1)❤️
48. Rotate ImageGoMediumO(n)O(1)
53. Maximum SubarrayGoEasyO(n)O(n)
54. Spiral MatrixGoMediumO(n)O(n^2)
56. Merge IntervalsGoMediumO(n log n)O(1)
57. Insert IntervalGoHardO(n)O(1)
59. Spiral Matrix IIGoMediumO(n)O(n^2)
62. Unique PathsGoMediumO(n^2)O(n^2)
63. Unique Paths IIGoMediumO(n^2)O(n^2)
64. Minimum Path SumGoMediumO(n^2)O(n^2)
75. Sort ColorsGoMediumO(n)O(1)❤️
78. SubsetsGoMediumO(n^2)O(n)❤️
79. Word SearchGoMediumO(n^2)O(n^2)❤️
80. Remove Duplicates from Sorted Array IIGoMediumO(n)O(1
84. Largest Rectangle in HistogramGoMediumO(n)O(n)❤️
88. Merge Sorted ArrayGoEasyO(n)O(1)❤️
90. Subsets IIGoMediumO(n^2)O(n)❤️
120. TriangleGoMediumO(n^2)O(n)
121. Best Time to Buy and Sell StockGoEasyO(n)O(1)
122. Best Time to Buy and Sell Stock IIGoEasyO(n)O(1)
126. Word Ladder IIGoHardO(n)O(n^2)❤️
152. Maximum Product SubarrayGoMediumO(n)O(1)
167. Two Sum II - Input array is sortedGoEasyO(n)O(1)
209. Minimum Size Subarray SumGoMediumO(n)O(1)
216. Combination Sum IIIGoMediumO(n)O(1)❤️
217. Contains DuplicateGoEasyO(n)O(n)
219. Contains Duplicate IIGoEasyO(n)O(n)
283. Move ZeroesGoEasyO(n)O(1)
287. Find the Duplicate NumberGoEasyO(n)O(1)❤️
532. K-diff Pairs in an ArrayGoEasyO(n)O(n)
566. Reshape the MatrixGoEasyO(n^2)O(n^2)
628. Maximum Product of Three NumbersGoEasyO(n)O(1)
713. Subarray Product Less Than KGoMediumO(n)O(1)
714. Best Time to Buy and Sell Stock with Transaction FeeGoMediumO(n)O(1)
746. Min Cost Climbing StairsGoEasyO(n)O(1)
766. Toeplitz MatrixGoEasyO(n)O(1)
867. Transpose MatrixGoEasyO(n)O(1)
891. Sum of Subsequence WidthsGoHardO(n log n)O(1)
907. Sum of Subarray MinimumsGoMediumO(n)O(n)❤️
922. Sort Array By Parity IIGoMediumO(n)O(1)
969. Pancake SortingGoMediumO(n)O(1)❤️
977. Squares of a Sorted ArrayGoEasyO(n)O(1)
————————————————————————————————–———————–———–——–

⬅️上一页

下一页➡️

Calendar Sep 6, 2020
Edit Edit this page
本站总访问量:  次 您是本站第  位访问者