Skip to content

Commit 5d8ddd7

Browse files
diguagediguage
committed
增加“面试经典 150 题”和“热门100”
1 parent 0d44a5d commit 5d8ddd7

File tree

5 files changed

+866
-0
lines changed

5 files changed

+866
-0
lines changed

‎docs/index.adoc

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6593,6 +6593,10 @@ include::3115-maximum-prime-difference.adoc[leveloffset=+1]
65936593

65946594
include::0000-00-note.adoc[leveloffset=+1]
65956595

6596+
include::top-100-liked.adoc[leveloffset=+1]
6597+
6598+
include::top-interview-150.adoc[leveloffset=+1]
6599+
65966600
include::../logbook/202406.adoc[leveloffset=+1]
65976601

65986602
include::../logbook/202503.adoc[leveloffset=+1]

‎docs/top-100-liked.adoc

Lines changed: 208 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,208 @@
1+
[#top-100-liked]
2+
= LeetCode 热题 100
3+
4+
== 排序
5+
6+
. xref:0001-two-sum.adoc[1. Two Sum]
7+
. xref:0002-add-two-numbers.adoc[2. Add Two Numbers]
8+
. xref:0003-longest-substring-without-repeating-characters.adoc[3. Longest Substring Without Repeating Characters]
9+
. xref:0004-median-of-two-sorted-arrays.adoc[4. Median of Two Sorted Arrays]
10+
. xref:0005-longest-palindromic-substring.adoc[5. Longest Palindromic Substring]
11+
. xref:0011-container-with-most-water.adoc[11. Container With Most Water]
12+
. xref:0015-3sum.adoc[15. 3Sum]
13+
. xref:0017-letter-combinations-of-a-phone-number.adoc[17. Letter Combinations of a Phone Number]
14+
. xref:0019-remove-nth-node-from-end-of-list.adoc[19. Remove Nth Node From End of List]
15+
. xref:0020-valid-parentheses.adoc[20. Valid Parentheses]
16+
. xref:0021-merge-two-sorted-lists.adoc[21. Merge Two Sorted Lists]
17+
. xref:0022-generate-parentheses.adoc[22. Generate Parentheses]
18+
. xref:0023-merge-k-sorted-lists.adoc[23. Merge k Sorted Lists]
19+
. xref:0024-swap-nodes-in-pairs.adoc[24. Swap Nodes in Pairs]
20+
. xref:0025-reverse-nodes-in-k-group.adoc[25. Reverse Nodes in k-Group]
21+
. xref:0031-next-permutation.adoc[31. Next Permutation]
22+
. xref:0032-longest-valid-parentheses.adoc[32. Longest Valid Parentheses]
23+
. xref:0033-search-in-rotated-sorted-array.adoc[33. Search in Rotated Sorted Array]
24+
. xref:0034-find-first-and-last-position-of-element-in-sorted-array.adoc[34. Find First and Last Position of Element in Sorted Array]
25+
. xref:0035-search-insert-position.adoc[35. Search Insert Position]
26+
. xref:0039-combination-sum.adoc[39. Combination Sum]
27+
. xref:0041-first-missing-positive.adoc[41. First Missing Positive]
28+
. xref:0042-trapping-rain-water.adoc[42. Trapping Rain Water]
29+
. xref:0045-jump-game-ii.adoc[45. Jump Game II]
30+
. xref:0046-permutations.adoc[46. Permutations]
31+
. xref:0048-rotate-image.adoc[48. Rotate Image]
32+
. xref:0049-group-anagrams.adoc[49. Group Anagrams]
33+
. xref:0051-n-queens.adoc[51. N-Queens]
34+
. xref:0053-maximum-subarray.adoc[53. Maximum Subarray]
35+
. xref:0054-spiral-matrix.adoc[54. Spiral Matrix]
36+
. xref:0055-jump-game.adoc[55. Jump Game]
37+
. xref:0056-merge-intervals.adoc[56. Merge Intervals]
38+
. xref:0062-unique-paths.adoc[62. Unique Paths]
39+
. xref:0064-minimum-path-sum.adoc[64. Minimum Path Sum]
40+
. xref:0070-climbing-stairs.adoc[70. Climbing Stairs]
41+
. xref:0072-edit-distance.adoc[72. Edit Distance]
42+
. xref:0073-set-matrix-zeroes.adoc[73. Set Matrix Zeroes]
43+
. xref:0074-search-a-2d-matrix.adoc[74. Search a 2D Matrix]
44+
. xref:0075-sort-colors.adoc[75. Sort Colors]
45+
. xref:0076-minimum-window-substring.adoc[76. Minimum Window Substring]
46+
. xref:0078-subsets.adoc[78. Subsets]
47+
. xref:0079-word-search.adoc[79. Word Search]
48+
. xref:0084-largest-rectangle-in-histogram.adoc[84. Largest Rectangle in Histogram]
49+
. xref:0094-binary-tree-inorder-traversal.adoc[94. Binary Tree Inorder Traversal]
50+
. xref:0098-validate-binary-search-tree.adoc[98. Validate Binary Search Tree]
51+
. xref:0101-symmetric-tree.adoc[101. Symmetric Tree]
52+
. xref:0102-binary-tree-level-order-traversal.adoc[102. Binary Tree Level Order Traversal]
53+
. xref:0104-maximum-depth-of-binary-tree.adoc[104. Maximum Depth of Binary Tree]
54+
. xref:0105-construct-binary-tree-from-preorder-and-inorder-traversal.adoc[105. Construct Binary Tree from Preorder and Inorder Traversal]
55+
. xref:0108-convert-sorted-array-to-binary-search-tree.adoc[108. Convert Sorted Array to Binary Search Tree]
56+
. xref:0114-flatten-binary-tree-to-linked-list.adoc[114. Flatten Binary Tree to Linked List]
57+
. xref:0118-pascals-triangle.adoc[118. Pascal's Triangle]
58+
. xref:0121-best-time-to-buy-and-sell-stock.adoc[121. Best Time to Buy and Sell Stock]
59+
. xref:0124-binary-tree-maximum-path-sum.adoc[124. Binary Tree Maximum Path Sum]
60+
. xref:0128-longest-consecutive-sequence.adoc[128. Longest Consecutive Sequence]
61+
. xref:0131-palindrome-partitioning.adoc[131. Palindrome Partitioning]
62+
. xref:0136-single-number.adoc[136. Single Number]
63+
. xref:0138-copy-list-with-random-pointer.adoc[138. Copy List with Random Pointer]
64+
. xref:0139-word-break.adoc[139. Word Break]
65+
. xref:0141-linked-list-cycle.adoc[141. Linked List Cycle]
66+
. xref:0142-linked-list-cycle-ii.adoc[142. Linked List Cycle II]
67+
. xref:0146-lru-cache.adoc[146. LRU Cache]
68+
. xref:0148-sort-list.adoc[148. Sort List]
69+
. xref:0152-maximum-product-subarray.adoc[152. Maximum Product Subarray]
70+
. xref:0153-find-minimum-in-rotated-sorted-array.adoc[153. Find Minimum in Rotated Sorted Array]
71+
. xref:0155-min-stack.adoc[155. Min Stack]
72+
. xref:0160-intersection-of-two-linked-lists.adoc[160. Intersection of Two Linked Lists]
73+
. xref:0169-majority-element.adoc[169. Majority Element]
74+
. xref:0189-rotate-array.adoc[189. Rotate Array]
75+
. xref:0198-house-robber.adoc[198. House Robber]
76+
. xref:0199-binary-tree-right-side-view.adoc[199. Binary Tree Right Side View]
77+
. xref:0200-number-of-islands.adoc[200. Number of Islands]
78+
. xref:0206-reverse-linked-list.adoc[206. Reverse Linked List]
79+
. xref:0207-course-schedule.adoc[207. Course Schedule]
80+
. xref:0208-implement-trie-prefix-tree.adoc[208. Implement Trie (Prefix Tree)]
81+
. xref:0215-kth-largest-element-in-an-array.adoc[215. Kth Largest Element in an Array]
82+
. xref:0226-invert-binary-tree.adoc[226. Invert Binary Tree]
83+
. xref:0230-kth-smallest-element-in-a-bst.adoc[230. Kth Smallest Element in a BST]
84+
. xref:0234-palindrome-linked-list.adoc[234. Palindrome Linked List]
85+
. xref:0236-lowest-common-ancestor-of-a-binary-tree.adoc[236. Lowest Common Ancestor of a Binary Tree]
86+
. xref:0238-product-of-array-except-self.adoc[238. Product of Array Except Self]
87+
. xref:0239-sliding-window-maximum.adoc[239. Sliding Window Maximum]
88+
. xref:0240-search-a-2d-matrix-ii.adoc[240. Search a 2D Matrix II]
89+
. xref:0279-perfect-squares.adoc[279. Perfect Squares]
90+
. xref:0283-move-zeroes.adoc[283. Move Zeroes]
91+
. xref:0287-find-the-duplicate-number.adoc[287. Find the Duplicate Number]
92+
. xref:0295-find-median-from-data-stream.adoc[295. Find Median from Data Stream]
93+
. xref:0300-longest-increasing-subsequence.adoc[300. Longest Increasing Subsequence]
94+
. xref:0322-coin-change.adoc[322. Coin Change]
95+
. xref:0347-top-k-frequent-elements.adoc[347. Top K Frequent Elements]
96+
. xref:0394-decode-string.adoc[394. Decode String]
97+
. xref:0416-partition-equal-subset-sum.adoc[416. Partition Equal Subset Sum]
98+
. xref:0437-path-sum-iii.adoc[437. Path Sum III]
99+
. xref:0438-find-all-anagrams-in-a-string.adoc[438. Find All Anagrams in a String]
100+
. xref:0543-diameter-of-binary-tree.adoc[543. Diameter of Binary Tree]
101+
. xref:0560-subarray-sum-equals-k.adoc[560. Subarray Sum Equals K]
102+
. xref:0739-daily-temperatures.adoc[739. Daily Temperatures]
103+
. xref:0763-partition-labels.adoc[763. Partition Labels]
104+
. xref:0994-rotting-oranges.adoc[994. Rotting Oranges]
105+
. xref:1143-longest-common-subsequence.adoc[1143. Longest Common Subsequence]
106+
107+
== 原始排序
108+
109+
. xref:0001-two-sum.adoc[1. Two Sum]
110+
. xref:0049-group-anagrams.adoc[49. Group Anagrams]
111+
. xref:0128-longest-consecutive-sequence.adoc[128. Longest Consecutive Sequence]
112+
. xref:0283-move-zeroes.adoc[283. Move Zeroes]
113+
. xref:0011-container-with-most-water.adoc[11. Container With Most Water]
114+
. xref:0015-3sum.adoc[15. 3Sum]
115+
. xref:0042-trapping-rain-water.adoc[42. Trapping Rain Water]
116+
. xref:0003-longest-substring-without-repeating-characters.adoc[3. Longest Substring Without Repeating Characters]
117+
. xref:0438-find-all-anagrams-in-a-string.adoc[438. Find All Anagrams in a String]
118+
. xref:0560-subarray-sum-equals-k.adoc[560. Subarray Sum Equals K]
119+
. xref:0239-sliding-window-maximum.adoc[239. Sliding Window Maximum]
120+
. xref:0076-minimum-window-substring.adoc[76. Minimum Window Substring]
121+
. xref:0053-maximum-subarray.adoc[53. Maximum Subarray]
122+
. xref:0056-merge-intervals.adoc[56. Merge Intervals]
123+
. xref:0189-rotate-array.adoc[189. Rotate Array]
124+
. xref:0238-product-of-array-except-self.adoc[238. Product of Array Except Self]
125+
. xref:0041-first-missing-positive.adoc[41. First Missing Positive]
126+
. xref:0073-set-matrix-zeroes.adoc[73. Set Matrix Zeroes]
127+
. xref:0054-spiral-matrix.adoc[54. Spiral Matrix]
128+
. xref:0048-rotate-image.adoc[48. Rotate Image]
129+
. xref:0240-search-a-2d-matrix-ii.adoc[240. Search a 2D Matrix II]
130+
. xref:0160-intersection-of-two-linked-lists.adoc[160. Intersection of Two Linked Lists]
131+
. xref:0206-reverse-linked-list.adoc[206. Reverse Linked List]
132+
. xref:0234-palindrome-linked-list.adoc[234. Palindrome Linked List]
133+
. xref:0141-linked-list-cycle.adoc[141. Linked List Cycle]
134+
. xref:0142-linked-list-cycle-ii.adoc[142. Linked List Cycle II]
135+
. xref:0021-merge-two-sorted-lists.adoc[21. Merge Two Sorted Lists]
136+
. xref:0002-add-two-numbers.adoc[2. Add Two Numbers]
137+
. xref:0019-remove-nth-node-from-end-of-list.adoc[19. Remove Nth Node From End of List]
138+
. xref:0024-swap-nodes-in-pairs.adoc[24. Swap Nodes in Pairs]
139+
. xref:0025-reverse-nodes-in-k-group.adoc[25. Reverse Nodes in k-Group]
140+
. xref:0138-copy-list-with-random-pointer.adoc[138. Copy List with Random Pointer]
141+
. xref:0148-sort-list.adoc[148. Sort List]
142+
. xref:0023-merge-k-sorted-lists.adoc[23. Merge k Sorted Lists]
143+
. xref:0146-lru-cache.adoc[146. LRU Cache]
144+
. xref:0094-binary-tree-inorder-traversal.adoc[94. Binary Tree Inorder Traversal]
145+
. xref:0104-maximum-depth-of-binary-tree.adoc[104. Maximum Depth of Binary Tree]
146+
. xref:0226-invert-binary-tree.adoc[226. Invert Binary Tree]
147+
. xref:0101-symmetric-tree.adoc[101. Symmetric Tree]
148+
. xref:0543-diameter-of-binary-tree.adoc[543. Diameter of Binary Tree]
149+
. xref:0102-binary-tree-level-order-traversal.adoc[102. Binary Tree Level Order Traversal]
150+
. xref:0108-convert-sorted-array-to-binary-search-tree.adoc[108. Convert Sorted Array to Binary Search Tree]
151+
. xref:0098-validate-binary-search-tree.adoc[98. Validate Binary Search Tree]
152+
. xref:0230-kth-smallest-element-in-a-bst.adoc[230. Kth Smallest Element in a BST]
153+
. xref:0199-binary-tree-right-side-view.adoc[199. Binary Tree Right Side View]
154+
. xref:0114-flatten-binary-tree-to-linked-list.adoc[114. Flatten Binary Tree to Linked List]
155+
. xref:0105-construct-binary-tree-from-preorder-and-inorder-traversal.adoc[105. Construct Binary Tree from Preorder and Inorder Traversal]
156+
. xref:0437-path-sum-iii.adoc[437. Path Sum III]
157+
. xref:0236-lowest-common-ancestor-of-a-binary-tree.adoc[236. Lowest Common Ancestor of a Binary Tree]
158+
. xref:0124-binary-tree-maximum-path-sum.adoc[124. Binary Tree Maximum Path Sum]
159+
. xref:0200-number-of-islands.adoc[200. Number of Islands]
160+
. xref:0994-rotting-oranges.adoc[994. Rotting Oranges]
161+
. xref:0207-course-schedule.adoc[207. Course Schedule]
162+
. xref:0208-implement-trie-prefix-tree.adoc[208. Implement Trie (Prefix Tree)]
163+
. xref:0046-permutations.adoc[46. Permutations]
164+
. xref:0078-subsets.adoc[78. Subsets]
165+
. xref:0017-letter-combinations-of-a-phone-number.adoc[17. Letter Combinations of a Phone Number]
166+
. xref:0039-combination-sum.adoc[39. Combination Sum]
167+
. xref:0022-generate-parentheses.adoc[22. Generate Parentheses]
168+
. xref:0079-word-search.adoc[79. Word Search]
169+
. xref:0131-palindrome-partitioning.adoc[131. Palindrome Partitioning]
170+
. xref:0051-n-queens.adoc[51. N-Queens]
171+
. xref:0035-search-insert-position.adoc[35. Search Insert Position]
172+
. xref:0074-search-a-2d-matrix.adoc[74. Search a 2D Matrix]
173+
. xref:0034-find-first-and-last-position-of-element-in-sorted-array.adoc[34. Find First and Last Position of Element in Sorted Array]
174+
. xref:0033-search-in-rotated-sorted-array.adoc[33. Search in Rotated Sorted Array]
175+
. xref:0153-find-minimum-in-rotated-sorted-array.adoc[153. Find Minimum in Rotated Sorted Array]
176+
. xref:0004-median-of-two-sorted-arrays.adoc[4. Median of Two Sorted Arrays]
177+
. xref:0020-valid-parentheses.adoc[20. Valid Parentheses]
178+
. xref:0155-min-stack.adoc[155. Min Stack]
179+
. xref:0394-decode-string.adoc[394. Decode String]
180+
. xref:0739-daily-temperatures.adoc[739. Daily Temperatures]
181+
. xref:0084-largest-rectangle-in-histogram.adoc[84. Largest Rectangle in Histogram]
182+
. xref:0215-kth-largest-element-in-an-array.adoc[215. Kth Largest Element in an Array]
183+
. xref:0347-top-k-frequent-elements.adoc[347. Top K Frequent Elements]
184+
. xref:0295-find-median-from-data-stream.adoc[295. Find Median from Data Stream]
185+
. xref:0121-best-time-to-buy-and-sell-stock.adoc[121. Best Time to Buy and Sell Stock]
186+
. xref:0055-jump-game.adoc[55. Jump Game]
187+
. xref:0045-jump-game-ii.adoc[45. Jump Game II]
188+
. xref:0763-partition-labels.adoc[763. Partition Labels]
189+
. xref:0070-climbing-stairs.adoc[70. Climbing Stairs]
190+
. xref:0118-pascals-triangle.adoc[118. Pascal's Triangle]
191+
. xref:0198-house-robber.adoc[198. House Robber]
192+
. xref:0279-perfect-squares.adoc[279. Perfect Squares]
193+
. xref:0322-coin-change.adoc[322. Coin Change]
194+
. xref:0139-word-break.adoc[139. Word Break]
195+
. xref:0300-longest-increasing-subsequence.adoc[300. Longest Increasing Subsequence]
196+
. xref:0152-maximum-product-subarray.adoc[152. Maximum Product Subarray]
197+
. xref:0416-partition-equal-subset-sum.adoc[416. Partition Equal Subset Sum]
198+
. xref:0032-longest-valid-parentheses.adoc[32. Longest Valid Parentheses]
199+
. xref:0062-unique-paths.adoc[62. Unique Paths]
200+
. xref:0064-minimum-path-sum.adoc[64. Minimum Path Sum]
201+
. xref:0005-longest-palindromic-substring.adoc[5. Longest Palindromic Substring]
202+
. xref:1143-longest-common-subsequence.adoc[1143. Longest Common Subsequence]
203+
. xref:0072-edit-distance.adoc[72. Edit Distance]
204+
. xref:0136-single-number.adoc[136. Single Number]
205+
. xref:0169-majority-element.adoc[169. Majority Element]
206+
. xref:0075-sort-colors.adoc[75. Sort Colors]
207+
. xref:0031-next-permutation.adoc[31. Next Permutation]
208+
. xref:0287-find-the-duplicate-number.adoc[287. Find the Duplicate Number]

0 commit comments

Comments
 (0)