├── .gitignore
└── Readme.md


/.gitignore:
--------------------------------------------------------------------------------
1 | .DS_Store


--------------------------------------------------------------------------------
/Readme.md:
--------------------------------------------------------------------------------
  1 | LeetCode collection.
  2 | 
  3 | 
  4 | | Date | Question Numbers | :sparkles: Star !|
  5 | | :---  | :--: | ---:|
  6 | | 数组和动态数组|||
  7 | |          |73. Set Matrix Zeroes  ||
  8 | |          |48. Rotate Image  ||
  9 | |          |344. Reverse String  ||
 10 | |          |414. Third Maximum Number  ||
 11 | |          |448. Find All Numbers Disappeared in an Array  ||
 12 | |          |66. Plus One  ||
 13 | |          |238. Product of Array Except Self||
 14 | |          |697. Degree of an Array  ||
 15 | |          |849. Maximize Distance to Closest Person  ||
 16 | |          |189. Rotate Array  ||
 17 | |          |Lint-39. Recover Rotated Sorted Array 三步翻转法 ！！！！ ||
 18 | |          |54. Spiral Matrix  ||
 19 | |          |  ||
 20 | |          |  ||
 21 | |          |  ||
 22 | | 递归          |  ||
 23 | |          |784. Letter Case Permutation  ||
 24 | |          |31. Next Permutation  ||
 25 | |          |  ||
 26 | |          |  ||
 27 | |          |  ||
 28 | |          |  ||
 29 | |          |  ||
 30 | | 二分搜索          |  ||
 31 | |          |50. Pow(x, n)||
 32 | |          |34. Find First and Last Position of Element in Sorted Array  |1-yes |
 33 | |          |35. Search Insert Position  |1-yes|
 34 | |          |658. Find K Closest Elements  |1-no |
 35 | |          |33. Search in Rotated Sorted Array  | 1-no |
 36 | |          |81. Search in Rotated Sorted Array II  |1-no |
 37 | |          |153. Find Minimum in Rotated Sorted Array  ||
 38 | |          |154. Find Minimum in Rotated Sorted Array II  ||
 39 | |          |702. Search in a Sorted Array of Unknown Size 这个题定量分析 ！ |1-no |
 40 | |          |74. Search a 2D Matrix  |1-no |
 41 | |          |240. Search a 2D Matrix II  |1-no |
 42 | |          |162. Find Peak Element  |1-no |
 43 | |          |69. Sqrt(x)  |1-yes |
 44 | |          |Lint-586. Sqrt(x) II  ||
 45 | |          |4. Median of Two Sorted Array  和下面的题是一样的||
 46 | |          |Lint-931. Median of K Sorted Arrays  ||
 47 | |          |Laicode: Kth Smallest In Two Sorted Arrays 这个题非常重要！可以到 logn+logk  |bilibili|
 48 | |          |7. Reverse Integer  ||
 49 | |          |475. Heaters  ||
 50 | |          |57. Insert Interval  ||
 51 | |          |349. Intersection of Two Arrays  ||
 52 | |          |Lint-140. Fast Power  ||
 53 | |          |378. Kth Smallest Element in a Sorted Matrix 二分中的逼近法 ||
 54 | |          |302. Smallest Rectangle Enclosing Black Pixels 二分中的逼近法 ||
 55 | |          |Lint-183. Wood Cut  ||
 56 | |          |  ||
 57 | |          |  ||
 58 | |          |  ||
 59 | |          |  ||
 60 | |          |  ||
 61 | |          |经验：并不是所有二分法都适用于 left+1<right, 对于可以排除mid的问题，使用left<=right更简便  ||
 62 | |          |  ||
 63 | | 线段树 segment tree         |  ||
 64 | |          |Lint-201. Segment Tree Build  ||
 65 | |          |Lint-439. Segment Tree Build II  | max的，触底反弹|
 66 | |          |Lint-202. Segment Tree Query  ||
 67 | |          |Lint-247. Segment Tree Query II  ||
 68 | |          |Lint-203. Segment Tree Modify  ||
 69 | |          |206. Interval Sum  ||
 70 | |          |207. Interval Sum II  ||
 71 | |          |248. Count of Smaller Number  ||
 72 | |          |249. Count of Smaller Number before itself  ||
 73 | |          |  ||
 74 | |          |  ||
 75 | |          |307. Range Sum Query - Mutable 还没做  ||
 76 | |          |817. Range Sum Query 2D - Mutable  ||
 77 | |          |665. Range Sum Query 2D - Immutable  ||
 78 | |          |  ||
 79 | | 扫描线        |  ||
 80 | |          |Lint-391. Number of Airplanes in the Sky  ||
 81 | |          |218. The Skyline Problem  ||
 82 | |          |253. Meeting Rooms II  ||
 83 | |          |  ||
 84 | |          |  ||
 85 | |          |  ||
 86 | |          |  ||
 87 | |          |  ||
 88 | | 排序         |  ||
 89 | |          |969. Pancake Sorting  ||
 90 | |          |347. Top K Frequent Elements 桶排序  ||
 91 | |          |296. Best Meeting Point  ||
 92 | |          |Lint-139. Subarray Sum Closest  ||
 93 | |          |643. Maximum Average Subarray I  ||
 94 | |          |644. Maximum Average Subarray II 二分法，尺举法 ||
 95 | |          |Lint-64. Merge Sorted Array  ||
 96 | |          |56. Merge Intervals  | 关键是保证开头是sort|
 97 | |          |Lint-577. Merge K Sorted Interval Lists  | |
 98 | |          |280. Wiggle Sort  ||
 99 | |          |324. Wiggle Sort II 不会 ||
100 | |          |164. Maximum Gap  ||
101 | |          | 归并变种 ||
102 | |          |493. Reverse Pairs 归并排序 ||
103 | |          |  ||
104 | |          |  ||
105 | |          | --- ||
106 | |          | 快排变种 ||
107 | |          |215. Kth Largest Element in an Array  ||
108 | |          |Lint-143. Sort Colors II  彩虹排序  ||
109 | |          |  ||
110 | |          |  ||
111 | |          |  ||
112 | |          |  ||
113 | |          |  ||
114 | |          |  ||
115 | | 分治法|  ||
116 | |          |349. Intersection of Two Arrays  ||
117 | |          |350. Intersection of Two Arrays II  ||
118 | |          |53.Maximum Subarray  这题实际是动态规划||
119 | |          |311. Sparse Matrix Multiplication ||
120 | |          |523. Continuous Subarray Sum  ||
121 | |          |241. Different Ways to Add Parentheses 分治，递归 ||
122 | |          |  ||
123 | |          |  ||
124 | |          |  ||
125 | |          |  ||
126 | | 链表          |  ||
127 | |          |237. Delete Node in a Linked List ||
128 | |          |876. Middle of the Linked List  ||
129 | |          |141. Linked List Cycle  ||
130 | |          |142. Linked List Cycle II (找到环的开始)  ||
131 | |          |19. Remove Nth Node From End of List  ||
132 | |          |21. Merge Two Sorted Lists  ||
133 | |          |160. Intersection of Two Linked Lists  ||
134 | |          |147. Insertion Sort List  ||
135 | |          |148. Sort List  ||
136 | |          |86. Partition List  ||
137 | |          |206. Reverse Linked List  ||
138 | |          |92. Reverse Linked List II  ||
139 | |          |25. Reverse Nodes in k-Group  |没做出来，要重新看一遍|
140 | |          |234. Palindrome Linked List 回文  |不会|
141 | |          |83. Remove Duplicates from Sorted List  ||
142 | |          |82. Remove Duplicates from Sorted List II  ||
143 | |          |61. Rotate List  还没做||
144 | |          |24. Swap Nodes in Pairs  ||
145 | |          |  ||
146 | |          |  ||
147 | |          |  ||
148 | |          |  ||
149 | |          |  ||
150 | |          |  ||
151 | |          |  ||
152 | |堆栈和队列          |  ||
153 | |          |32. Longest Valid Parentheses   ||
154 | |          |71. Simplify Path  ||
155 | |          |394. Decode String  ||
156 | |          |682. Baseball Game  ||
157 | |          |735. Asteroid Collision  ||
158 | |          |239. Sliding Window Maximum 还没做，优先考虑用队列的方法 ||
159 | |          |224. Basic Calculator  ||
160 | |          |456. 132 Pattern  ||
161 | |          |402. Remove K Digits  ||
162 | |          |946. Validate Stack Sequences  ||
163 | |          |621. Task Scheduler  还没做 ||
164 | |          |622. Design Circular Queue  还没做 ||
165 | |          |973. K Closest Points to Origin  ||
166 | |   | 栈 Stack  | 栈的精髓：把 递归中最后处理 的 压在最前面 |
167 | |          |232. Implement Queue using Stacks  ||
168 | |          |225. Implement Stack using Queues  ||
169 | |          |20. Valid Parentheses  ||
170 | |          |150. Evaluate Reverse Polish Notation 反波兰表达式 ||
171 | |          |155. Min Stack   ||
172 | |          |Lint-22. Flatten List  ||
173 | |          |341. Flatten Nested List Iterator  ||
174 | |          |251. Flatten 2D Vector  ||
175 | |          |  ||
176 | |        | 单调栈 ||
177 | |          |739. Daily Temperatures  ||
178 | |          |1019. Next Greater Node In Linked List  ||
179 | |          |496. Next Greater Element I  单调栈  ||
180 | |          |503. Next Greater Element II  ||
181 | |          |84. Largest Rectangle in Histogram  ||
182 | |          |85. Maximal Rectangle  ||
183 | |          |654. Maximum Binary Tree 单调栈 经典～！！ ||
184 | |          |Lint-367. Expression Tree Build   和leetcode654一样 ||
185 | |          |Lint-368. Expression Evaluation 中缀变后缀表达式再计算 ||
186 | |          |  ||
187 | |          | ---- ||
188 | |   | 队列 queue  ||
189 | |          |Lint-230. Animal Shelter 双端队列，链表  ||
190 | |          |346. Moving Average from Data Stream  ||
191 | |          |239. Sliding Window Maximum  ||
192 | |          |  ||
193 | |          |  ||
194 | |          |  ||
195 | |          |  ||
196 | |          |  ||
197 | |          |  ||
198 | | 哈希表          |  ||
199 | |          |387. First Unique Character in a String 这题要用过一遍的方法！非常重要！ ||
200 | |          |146. LRU Cache  ||
201 | |          |Lint-685. First Unique Number in Data Stream  ||
202 | |          |349. Intersection of Two Arrays  ||
203 | |          |350. Intersection of Two Arrays II  ||
204 | |          |771. Jewels and Stones  ||
205 | |          |217. Contains Duplicate  ||
206 | |          |219. Contains Duplicate II  ||
207 | |          |811. Subdomain Visit Count  ||
208 | |          |500. Keyboard Row  ||
209 | |          |380. Insert Delete GetRandom O(1)  ||
210 | |          |36. Valid Sudoku  ||
211 | |          |Lint-594. strStr II 这题不用会 |https://www.jiuzhang.com/video/rabin-karp|
212 | |          |Lint-138. Subarray Sum  ||
213 | |          |Lint-404. Subarray Sum II  ||
214 | |          |Lint-405. Submatrix Sum  ||
215 | |          |Lint-944. Maximum Submatrix  | 和53一样，降维攻击|
216 | |          |560. Subarray Sum Equals K  ||
217 | |          |53. Maximum Subarray 前缀和 ||
218 | |          |Lint-558. Sliding Window Matrix Maximum  ||
219 | |          |  ||
220 | | 堆          |  ||
221 | |          |215. Kth Largest Element in an Array  |y |
222 | |          |692. Top K Frequent Words  ||
223 | |          |263. Ugly Number  ||
224 | |          |264. Ugly Number II  ||
225 | |          |373. Find K Pairs with Smallest Sums  |n |
226 | |          |23. Merge k Sorted Lists  ||
227 | |          |295. Find Median from Data Stream  ||
228 | |          |480. Sliding Window Median  ||
229 | |          |502. IPO  ||
230 | |          |451. Sort Characters By Frequency 还没做  ||
231 | |          |871. Minimum Number of Refueling Stops 还没做  ||
232 | |          |407. Trapping Rain Water II  ||
233 | |          |378. Kth Smallest Element in a Sorted Matrix | klogk |
234 | |          |42. Trapping Rain Water 单调栈 ||
235 | |          |407. Trapping Rain Water II  ||
236 | |          |  ||
237 | |          |  ||
238 | |          |  ||
239 | |          |  ||
240 | | 树          |  ||
241 | |       | 二叉树   ||
242 | |          |270. Closest Binary Search Tree Value  ||
243 | |          |272. Closest Binary Search Tree Value II  ||
244 | |          |114. Flatten Binary Tree to Linked List  ||
245 | |          |110. Balanced Binary Tree  ||
246 | |          |98. Validate Binary Search Tree 判断二叉搜索树 ||
247 | |          |173. Binary Search Tree Iterator  ||
248 | |          |235. Lowest Common Ancestor of a Binary Search Tree  ||
249 | |          |236. Lowest Common Ancestor of a Binary Tree  ||
250 | |          |108. Convert Sorted Array to Binary Search Tree  ||
251 | |          |109. Convert Sorted List to Binary Search Tree  ||
252 | |          |298. Binary Tree Longest Consecutive Sequence  ||
253 | |          |549. Binary Tree Longest Consecutive Sequence II  ||
254 | |          |958. Check Completeness of a Binary Tree  ||
255 | |          |  ||
256 | |          |  ||
257 | |          |----  ||
258 | |          |104. Maximum Depth of Binary Tree  ||
259 | |          |110. Balanced Binary Tree  ||
260 | |          |101. Symmetric Tree  ||
261 | |          |100. Same Tree  ||
262 | |          |700. Search in a Binary Search Tree  ||
263 | |          |450. Delete Node in a BST  ||
264 | |          |701. Insert into a Binary Search Tree 见算法导论 165||
265 | |          |94. Binary Tree Inorder Traversal 用栈实现iterative ||
266 | |          |230. Kth Smallest Element in a BST 用栈实现inorder遍历 ||
267 | |          |144. Binary Tree Preorder Traversal  ||
268 | |          |145. Binary Tree Postorder Traversal  |栈的精髓：把 递归中最后处理 的 压在最前面 |
269 | |          |102. Binary Tree Level Order Traversal  这个一道BFS,和773对比||
270 | |          |107. Binary Tree Level Order Traversal II  ||
271 | |          |513. Find Bottom Left Tree Value  ||
272 | |          |  ||
273 | |          |  ||
274 | |          |103. Binary Tree Zigzag Level Order Traversal  ||
275 | |          |105. Construct Binary Tree from Preorder and Inorder Traversal 这题不太理解本质 ||
276 | |          |111. Minimum Depth of Binary Tree ||
277 | |          |257. Binary Tree Paths  ||
278 | |          |112. Path Sum  ||
279 | |          |113. Path Sum II  ||
280 | |          |437. Path Sum III  ||
281 | |          |124. Binary Tree Maximum Path Sum  ||
282 | |          |Lint-472. Binary Tree Path Sum III 二叉树无向图的构建 ||
283 | |          |450. Delete Node in a BST 还没做  ||
284 | |          |938. Range Sum of BST 还没做  ||
285 | |          |  ||
286 | |          |  ||
287 | |          |  ||
288 | |          |  ||
289 | |          |  ||
290 | |          |  ||
291 | |          |  ||
292 | |          |  ||
293 | |          |  ||
294 | |          |  ||
295 | | 图论          |  ||
296 | |       |宽度优先搜索  | 重要：能用BFS做的题，就不要用DFS！|
297 | |          |200. Number of Islands  ||
298 | |          |Lint-611. Knight Shortest Path  用字典可以记录 见过的点，和对应距离||
299 | |          |133. Clone Graph  ||
300 | |          |297. Serialize and Deserialize Binary Tree 这个题还是有点蒙 ||
301 | |          |127. Word Ladder  ||
302 | |          |126. Word Ladder II  ||
303 | |          |Lint-794. Sliding Puzzle II  ||
304 | |          |773. Sliding Puzzle 处理二维矩阵的技巧 ||
305 | |          |102. Binary Tree Level Order Traversal  这个一道BFS,和773对比||
306 | |          |Lint-531. Six Degrees  ||
307 | |          |Lint-573. Build Post Office II  ||
308 | |          |752. Open the Lock  ||
309 | |          |  ||
310 | |          |  ||
311 | |          |  ||
312 | |          | 拓扑排序 ||
313 | |          |207. Course Schedule   ||
314 | |          |210. Course Schedule II  ||
315 | |          |Lint-815. Course Schedule IV 还不会！！！ ||
316 | |          |444. Sequence Reconstruction  ||
317 | |          |Lint-127. Topological Sorting  ||
318 | |          | ---- ||
319 | |       | 深度优先搜索 ||
320 | |          | 回溯法 | 在不能继续搜索的点，直接return |
321 | |          |22. Generate Parentheses  ||
322 | |          |17. Letter Combinations of a Phone Number 回溯法  ||
323 | |          |46. Permutations  ||
324 | |          |47. Permutations II  ||
325 | |          |60. Permutation Sequence  ||
326 | |          |39. Combination Sum 回溯法 ||
327 | |          |40. Combination Sum II  ||
328 | |          |78. Subsets  ||
329 | |          |90. Subsets II  ||
330 | |          |51. N-Queens ||
331 | |          |290. Word Pattern  ||
332 | |          |291. Word Pattern II  回溯 ||
333 | |          |79. Word Search  ||
334 | |          |294. Flip Game II  ||
335 | |          |  ||
336 | |          |  ||
337 | |          | --- ||
338 | |          |490. The Maze  ||
339 | |          |505. The Maze II  | 黑色（已经pop出来的,才放seen）不压栈，不压队。Dijkstra是BFS|
340 | |          |499. The Maze III  ||
341 | |          |733. Flood Fill  ||
342 | |          |547. Friend Circles  ||
343 | |          |695. Max Area of Island |stack,queue,只要append完了，立刻放seen|
344 | |          |690. Employee Importance  ||
345 | |          |785. Is Graph Bipartite?  |涂颜色|
346 | |          |417. Pacific Atlantic Water Flow  ||
347 | |          |542. 01 Matrix  |n 不会|
348 | |          |721. Accounts Merge  |考察点，把数据转换成图|
349 | |          |210. Course Schedule II  ||
350 | |          |630. Course Schedule III  ||
351 | |          |997. Find the Town Judge  ||
352 | |          |407. Trapping Rain Water II 还没做 ||
353 | |          |743. Network Delay Time  ||
354 | |          |282. Expression Add Operators 这个题好多的边界条件 ||
355 | |          |301. Remove Invalid Parentheses BFS剪枝 ||
356 | |          |  ||
357 | |          |  ||
358 | | 并查集         |  ||
359 | |          |261. Graph Valid Tree  ||
360 | |          |130. Surrounded Regions  ||
361 | |          |128. Longest Consecutive Sequence  ||
362 | |          |Lint-629. Minimum Spanning Tree  最小生成树，Kruskal算法  ||
363 | |          |684. Redundant Connection  ||
364 | |          |305. Number of Islands II 很重要的并查集的题 ||
365 | |          |Lint-589. Connecting Graph  ||
366 | |          |Lint-590. Connecting Graph II  ||
367 | |          |Lint-591. Connecting Graph III  ||
368 | |          |Lint-432. Find the Weak Connected Component in the Directed Graph 最后一块没看懂 ||
369 | |          |721. Accounts Merge  ||
370 | |          |  ||
371 | |          |  ||
372 | |          |  ||
373 | |          |  ||
374 | |          |  ||
375 | |          |  ||
376 | | 双指针          |  ||
377 | |          |287. Find the Duplicate Number 兔子和乌龟 ||
378 | |          |170. Two Sum III - Data structure design  ||
379 | |          |283. Move Zeroes  ||
380 | |          |26. Remove Duplicates from Sorted Array 兔子乌龟 ||
381 | |          |344. Reverse String  ||
382 | |          |1. Two Sum  其实这个是哈希表||
383 | |          |167. Two Sum II - Input array is sorted  ||
384 | |          |15. 3Sum  ||
385 | |          |16. 3Sum Closest  ||
386 | |          |18. 4Sum  ||
387 | |          |21. Merge Two Sorted Lists  ||
388 | |          |349. Intersection of Two Arrays  ||
389 | |          |523. Continuous Subarray Sum  ||
390 | |          |Lint-402. Continuous Subarray Sum  ||
391 | |          |Lint-403. Continuous Subarray Sum II  ||
392 | |          |169. Majority Element  ||
393 | |          |229. Majority Element II  摩尔投票算法||
394 | |          |75. Sort Colors  荷兰国旗：很经典的一道题||
395 | |          |Lint-143. Sort Colors II  ||
396 | |          |11. Container With Most Water 装水的题 ||
397 | |          |42. Trapping Rain Water  | 不会 |
398 | |          |125. Valid Palindrome  ||
399 | |          |986. Interval List Intersections  ||
400 | |          |Lint-839. Merge Two Sorted Interval Lists  ||
401 | |          |  ||
402 | |          |  ||
403 | |滑动窗口          |  ||
404 | |          |845. Longest Mountain in Array  |未做|
405 | |          |26. Remove Duplicates from Sorted Array  ||
406 | |          |80. Remove Duplicates from Sorted Array II  ||
407 | |          |27. Remove Element  ||
408 | |          |28. Implement strStr()  ||
409 | |          |713. Subarray Product Less Than K  ||
410 | |          |438. Find All Anagrams in a String  ||
411 | |          |159. Longest Substring with At Most Two Distinct Characters  |还没做|
412 | |          |340. Longest Substring with At Most K Distinct Characters  |还没做|
413 | |          |239. Sliding Window Maximum  可以用堆 |还没做|
414 | |          |480. Sliding Window Median  ||
415 | |          |  ||
416 | |      | 同向双指针 ||
417 | |          |209. Minimum Size Subarray Sum  | 同向双指针|
418 | |          |3. Longest Substring Without Repeating Characters  ||
419 | |          |76. Minimum Window Substring  ||
420 | |          |340. Longest Substring with At Most K Distinct Characters  ||
421 | |          |  ||
422 | |          |  ||
423 | |动态规划          |  ||
424 | |          |198. House Robber  ||
425 | |          |213. House Robber II  ||
426 | |          |337. House Robber III  ||
427 | |          |746. Min Cost Climbing Stairs  ||
428 | |          |96. Unique Binary Search Trees  |科特兰数|
429 | |          |714. Best Time to Buy and Sell Stock with Transaction Fee  ||
430 | |          |70. Climbing Stairs   ||
431 | |          |276. Paint Fence  ||
432 | |          |368. Largest Divisible Subset  ||
433 | |          |343. Integer Break  ||
434 | |          |583. Delete Operation for Two Strings  ||
435 | |          |877. Stone Game  ||
436 | |          |1140. Stone Game II  ||
437 | |          |  ||
438 | |    |记忆化搜索  ||
439 | |          |139. Word Break  ||
440 | |          |140. Word Break II  ||
441 | |          |Lint-683. Word Break III  ||
442 | |          |  ||
443 | |       |九章算法 动态规划：       |  |
444 | |          |322. Coin Change 典型  ||
445 | |          |62. Unique Paths 计数型动态规划  ||
446 | |          |63. Unique Paths II 坐标型动态规划 ||
447 | |          |55. Jump Game 存在型动态规划  ||
448 | |          |152. Maximum Product Subarray ||
449 | |          |91. Decode Ways 划分型动态规划 ||
450 | |          |64. Minimum Path Sum 坐标型 (可以用滚动数组节省空间) ||
451 | |          |361. Bomb Enemy 坐标型  ||
452 | |          |674. Longest Continuous Increasing Subsequence  ||
453 | |          |329. Longest Increasing Path in a Matrix  ||
454 | |          |338. Counting Bits  ||
455 | |      |序列型动态规划：          ||
456 | |          |Lint-843. Digital Flip   ||
457 | |          |256. Paint House 序列型动态规划  ||
458 | |          |265. Paint House II  ||
459 | |          |121. Best Time to Buy and Sell Stock  ||
460 | |          |122. Best Time to Buy and Sell Stock II  ||
461 | |          |123. Best Time to Buy and Sell Stock III  ||
462 | |          |188. Best Time to Buy and Sell Stock IV 还没做 ||
463 | |          |309. Best Time to Buy and Sell Stock with Cooldown  ||
464 | |          |300. Longest Increasing Subsequence   ||
465 | |          |354. Russian Doll Envelopes 是300题的二维问题  ||
466 | |       |划分型动态规划            ||
467 | |          |279. Perfect Squares  BFS剪枝用set ||
468 | |          |132. Palindrome Partitioning II  ||
469 | |          |Lint-437. Copy Books  ||
470 | |       |博弈型动态规划          ||
471 | |          |Lint-394. Coins in a Line  ||
472 | |          |Lint-395. Coins in a Line II  ||
473 | |          |Lint-396. Coins in a Line III  ||
474 | |       |背包型动态规划 --- 背包的总承重通常都需要放在状态里          ||
475 | |          |Lint-92. Backpack 可行性 ||
476 | |          |Lint-563. Backpack V 计数型 ||
477 | |          |Lint-564. Combination Sum IV 计数型 ||
478 | |          |Lint-125. Backpack II 最值型 ||
479 | |          |Lint-440. Backpack III 最值型  这一题可以一维数组把空间优化到极致，见视频讲解||
480 | |          |416. Partition Equal Subset Sum  ||
481 | |       |区间型动态规划  | 取头 取尾|
482 | |          |516. Longest Palindromic Subsequence  在区间问题中，要按照区间长度的顺序计算||
483 | |          |  | 记忆化搜索，可以大大降低冗余。自上而下|
484 | |          |5. Longest Palindromic Substring  ||
485 | |          |87. Scramble String  ||
486 | |          |312. Burst Balloons 消去型题目  ||
487 | |       | 双序列动态规划  ||
488 | |          |1143. Longest Common Subsequence ||
489 | |          |97. Interleaving String  ||
490 | |          |72. Edit Distance  ||
491 | |          |10. Regular Expression Matching  ||
492 | |          |474. Ones and Zeroes  ||
493 | |          |115. Distinct Subsequences  ||
494 | |          |44. Wildcard Matching 还没做 ||
495 | |       | 动态规划难题专场 ||
496 | |          |221. Maximal Square  ||
497 | |          |639. Decode Ways II 还没做 ||
498 | |          |Lint-752. Rogue Knight Sven  ||
499 | |          |Lint-971. Surplus Value Backpack 这道题不用掌握  ||
500 | |          |Lint-89. k Sum  ||
501 | | 贪心算法         |  ||
502 | |          |455. Assign Cookies  ||
503 | |          |435. Non-overlapping Intervals 其实是活动选择问题  ||
504 | |          |  ||
505 | |          |  ||
506 | |          |  ||
507 | |          |  ||
508 | | 位操作          |  ||
509 | |          |29. Divide Two Integers  ||
510 | |          |191. Number of 1 Bits  ||
511 | |          |405. Convert a Number to Hexadecimal  不会 ||
512 | |          |231. Power of Two  ||
513 | |          |268. Missing Number  ||
514 | |          |397. Integer Replacement 还没做 ||
515 | |          |371. Sum of Two Integers  ||
516 | |          |172. Factorial Trailing Zeroes 还没做 ||
517 | |          |260. Single Number III  ||
518 | |          |  ||
519 | |          |  ||
520 | |          |  ||
521 | |          |  ||
522 | |          |  ||
523 | |          |  ||
524 | |          |  ||
525 | |          |  ||
526 | | 字符串         |  ||
527 | |          |551. Student Attendance Record I  ||
528 | |          |760. Find Anagram Mappings  ||
529 | |          |5. Longest Palindromic Substring  ||
530 | |          |242. Valid Anagram  ||
531 | |          |796. Rotate String  ||
532 | |          |9. Palindrome Number 还没做 ||
533 | |          |409. Longest Palindrome  ||
534 | |          |266. Palindrome Permutation  ||
535 | |          |267. Palindrome Permutation II  ||
536 | |          |516. Longest Palindromic Subsequence  ||
537 | |          |524. Longest Word in Dictionary through Deleting 还没做 ||
538 | |          |392. Is Subsequence  ||
539 | |          |648. Replace Words 还没做  ||
540 | |          |6. ZigZag Conversion  ||
541 | |          |8. String to Integer (atoi)  ||
542 | |          |12. Integer to Roman  ||
543 | |          |13. Roman to Integer  ||
544 | |          |14. Longest Common Prefix  ||
545 | |          |30. Substring with Concatenation of All Words  ||
546 | |          |248. Strobogrammatic Number III  ||
547 | |          |161. One Edit Distance  ||
548 | |          |  ||
549 | |          |  ||
550 | |       | 前缀树 ||
551 | |          |208. Implement Trie (Prefix Tree)  ||
552 | |          |211. Add and Search Word - Data structure design  ||
553 | |          |212. Word Search II 字典树 ||
554 | |          |72. Edit Distance  ||
555 | |          |Lint-623. K Edit Distance  ||
556 | |          |425. Word Squares  ||
557 | |          |  ||
558 | |          |  ||
559 | |          |  ||
560 | |          |  ||
561 | 
562 | 
563 | | Question Numbers  | :sparkles: Star ! |Second|Third|Forth|Fifth|
564 | | :---  |:--:|:--:|:--:|:--:|---:|
565 | |1-10||||||
566 | |11-20||||||
567 | |21-30||||||
568 | 
569 | 
570 | 
571 | 
572 | 
573 | 心得：
574 | 1. heap 特别适合用于解决有 candidate pool 的问题
575 | 
576 | 
577 | 


--------------------------------------------------------------------------------