| 141 |
141. Circular Linked List |
[LeetCode] 141, circular linked list |
Linked list, double pointer |
|
| 24 |
24. Pairwise exchange of nodes in the linked list |
【LeetCode】24. Swap nodes in the linked list in pairs |
Recursion, linked list |
|
| 142-II |
142. Circular Linked List II |
【LeetCode】142. Circular Linked List II |
Linked list, double pointer |
|
| 25 |
25. A set of K flip linked lists |
[LeetCode] A set of 25.K flip linked lists |
Linked list |
|
| 232 |
232. Realize Queue with Stack |
[LeetCode] 232. Realize Queue with Stack |
Stack, design |
|
| 225 |
225. Use queues to implement stacks |
[LeetCode] 225. Use queues to implement stacks |
Stack, design |
|
| 20 |
20. Valid parentheses |
【LeetCode】20. Valid parentheses |
Stack, string |
|
| 703 |
703. The Kth largest element in the data stream |
[LeetCode] 703. The Kth largest element in the data stream |
Stack, design |
|
| 242 |
242. Valid Letter Alien Words |
[LeetCode] 242. Valid letter variants |
Sorting, hash table |
|
| 15 |
15. Sansanowa |
【LeetCode】15. Sum of three numbers |
Array, double pointer |
|
| 18 |
18. Sum of Four Numbers |
【LeetCode】18. Sum of Four Numbers |
Array, hash, double pointer |
|
| 49 |
49. Grouping of Letter Alien Words |
[LeetCode] 49. Grouping of letter dysphorisms |
Hash table, string |
|
| 98 |
98. Verify Binary Search Tree |
【LeetCode】98. Verify Binary Search Tree |
Tree, DFS, recursion |
|
| 438 |
438. Find all letter dysphoric words in the string |
[LeetCode] 438. Find all letter dysphoric words in the string |
Hash table |
|
| 122 |
122. The Best Time to Buy and Sell Stocks II |
【LeetCode】122. The best time to buy and sell stocks II |
Greedy, array |
|
| 860 |
860. Lemonade Change |
【LeetCode】860. Lemonade change |
greedy |
|
| 455 |
455. Distribute Cookies |
【LeetCode】455. Distribute cookies |
greedy |
|
| 874 |
874. Simulated Walking Robot |
【LeetCode】874. Simulating walking robot |
greedy |
|
| 111 |
111. The minimum depth of a binary tree |
[LeetCode] 111. The minimum depth of a binary tree |
Tree, DFS, BFS |
|
| 22 |
22. Bracket generation |
[LeetCode] 22. Bracket generation |
String, traceback |
|
| 51 |
51. N Queen |
【LeetCode】51. N Queen |
Backtracking |
|
| 26 |
36. Effective Sudoku |
【LeetCode】36. Effective Sudoku |
Hash table |
|
| 52 |
52. Queen N II |
【LeetCode】52. N Queen II |
Backtracking |
|
| 37 |
37. Solving Sudoku |
【LeetCode】37. Solving Sudoku |
Backtracking, hashing |
|
| 121 |
121. The best time to buy and sell stocks |
[LeetCode] 121. The best time to buy and sell stocks (Sword refers to Offer 63) |
Array, dynamic programming |
|
| 69 |
69. Square root of x |
【LeetCode】69. The square root of x |
Mathematics, binary search |
|
| 367 |
367. Effective perfect squares |
【LeetCode】367. Effective perfect square number |
Mathematics, binary search |
|
| 208 |
208. Implement Trie (Prefix Tree) |
[LeetCode] 208. Implement Trie (prefix tree) |
Design, dictionary tree |
|
| 212 |
212. Word Search II |
【LeetCode】212. Word Search II |
Dictionary tree, backtracking |
|
| 231 |
231. Power of 2 |
[LeetCode] Power of 231.2 |
Bit operations, mathematics |
|
| 338 |
338. Bit count |
【LeetCode】338. Bit count |
Bit computing, dynamic programming |
|
| 200 |
200. Number of Islands |
【LeetCode】200. Number of islands |
DFS, BFS, and check set |
|
| 146 |
146. LRU Caching Mechanism |
[LeetCode] 146. LRU caching mechanism |
design |
|
| 120 |
120. Triangular minimum path sum |
[LeetCode] 120. The smallest path sum of the triangle |
Array, dynamic programming |
|
| 547 |
547. Number of Provinces |
【LeetCode】547. Moments of Friends |
DFS, and check set |
|
| 123 |
123. The best time to buy and sell stocks III |
[LeetCode] 123. The best time to buy and sell stocks III (with HashMap principle and application – hasCode() & equals() rewritten) |
Array, dynamic programming |
|
| 152 |
152. Maximum product sub-array |
[LeetCode] 152. Maximum product sub-array |
Array, dynamic programming |
|
| 188 |
188. The Best Time to Buy and Sell Stock IV |
【LeetCode】188. The best time to buy and sell stock IV |
Dynamic programming |
|
| 300 |
300. The longest increasing subsequence |
【LeetCode】300. The longest ascending subsequence |
Binary search, dynamic programming |
|
| 322 |
322. Change Exchange |
【LeetCode】322. Change Exchange |
Dynamic programming |
|
| 72 |
72. Edit distance |
【LeetCode】72. Edit distance |
String, dynamic programming |
|
| 493 |
493. 翻转对 |
【LeetCode】493. 翻转对 |
排序、树状数组、线段树、二分查找、分治算法 |
|
| 127 |
127. 单词接龙 |
【LeetCode】127. 单词接龙 |
BFS |
|
| 1091 |
1091. 二进制矩阵中的最短路径 |
【LeetCode】1091. 二进制矩阵中的最短路径 |
BFS |
|
| 334 |
334. 递增的三元子序列 |
【LeetCode】334. 递增的三元子序列 |
|
>300 |
|
|
|
|
|