Appearance
2026.8/9月总文档
一, overall
- 包含blind75, lc75 在内的总700道题计划
- 要注意后期可能进展会比前期慢很多,软柿子都被捏完了
二,完成情况,文档,日志
2026.8.7
- 创建文档,初始化
- 注意某些题目只存在文件未完成,注意筛选
三,详细分组 phase 1
1. Array / Hash / Two Pointer
- 单子
1, 15, 18, 36, 39, 40, 49, 73, 128, 152, 169, 189, 229, 442, 448, 560, 659, 670, 792, 846, 881, 905, 918
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 1 | Two Sum | 秒,再不用管了 | lc001 | 写过✅ |
| 15 | 3Sum | lc015 | 写过✅ | |
| 18 | 4Sum | |||
| 36 | Valid Sudoku | |||
| 39 | Combination Sum | lc039 | 写过✅ | |
| 40 | Combination Sum II | lc040 | 写过✅ | |
| 49 | Group Anagrams | |||
| 73 | Set Matrix Zeroes | |||
| 128 | Longest Consecutive Sequence | |||
| 152 | Maximum Product Subarray | |||
| 169 | Majority Element | |||
| 189 | Rotate Array | |||
| 229 | Majority Element II | |||
| 442 | Find All Duplicates in an Array | |||
| 448 | Find All Numbers Disappeared in an Array | |||
| 560 | Subarray Sum Equals K | |||
| 659 | Split Array into Consecutive Subsequences | |||
| 670 | Maximum Swap | |||
| 792 | Number of Matching Subsequences | |||
| 846 | Hand of Straights | |||
| 881 | Boats to Save People | |||
| 905 | Sort Array By Parity | |||
| 918 | Maximum Sum Circular Subarray |
2. Sliding Window
- 单子 3, 30, 76, 159, 209, 424, 438, 567, 713, 904, 930, 992, 1234, 1248, 1358
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 3 | Longest Substring Without Repeating Characters | 需重写,需打磨 | lc003 | 写过✅ |
| 30 | Substring with Concatenation of All Words | |||
| 76 | Minimum Window Substring | |||
| 159 | Longest Substring with At Most Two Distinct Characters | |||
| 209 | Minimum Size Subarray Sum | |||
| 424 | Longest Repeating Character Replacement | |||
| 438 | Find All Anagrams in a String | |||
| 567 | Permutation in String | |||
| 713 | Subarray Product Less Than K | |||
| 904 | Fruit Into Baskets | |||
| 930 | Binary Subarrays With Sum | |||
| 992 | Subarrays with K Different Integers | |||
| 1234 | Replace the Substring for Balanced String | |||
| 1248 | Count Number of Nice Subarrays | |||
| 1358 | Number of Substrings Containing All Three Characters |
3. Stack / Monotonic Stack
- 单子
20, 84, 85, 150, 224, 227, 394, 402, 503, 581, 636, 678, 853, 901, 907, 962, 1019, 1124, 1475, 1856
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 20 | Valid Parentheses | |||
| 84 | Largest Rectangle in Histogram | |||
| 85 | Maximal Rectangle | |||
| 150 | Evaluate Reverse Polish Notation | |||
| 224 | Basic Calculator | |||
| 227 | Basic Calculator II | |||
| 394 | Decode String | lc394 | 写过✅ | |
| 402 | Remove K Digits | |||
| 503 | Next Greater Element II | |||
| 581 | Shortest Unsorted Continuous Subarray | |||
| 636 | Exclusive Time of Functions | |||
| 678 | Valid Parenthesis String | |||
| 853 | Car Fleet | |||
| 901 | Online Stock Span | |||
| 907 | Sum of Subarray Minimums | |||
| 962 | Maximum Width Ramp | |||
| 1019 | Next Greater Node In Linked List | |||
| 1124 | Longest Well-Performing Interval | |||
| 1475 | Final Prices With a Special Discount in a Shop | |||
| 1856 | Maximum Subarray Min-Product |
4. Linked List
- 单子 2, 19, 21, 23, 24, 25, 61, 82, 83, 92, 138, 141, 142, 143, 148, 160, 203, 234, 328, 430
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 2 | Add Two Numbers | |||
| 19 | Remove Nth Node From End of List | lc019 | 写过✅ | |
| 21 | Merge Two Sorted Lists | lc021 | 写过✅ | |
| 23 | Merge k Sorted Lists | |||
| 24 | Swap Nodes in Pairs | |||
| 25 | Reverse Nodes in k-Group | |||
| 61 | Rotate List | |||
| 82 | Remove Duplicates from Sorted List II | |||
| 83 | Remove Duplicates from Sorted List | |||
| 92 | Reverse Linked List II | |||
| 138 | Copy List with Random Pointer | |||
| 141 | Linked List Cycle | lc141 | 写过✅ | |
| 142 | Linked List Cycle II | |||
| 143 | Reorder List | |||
| 148 | Sort List | |||
| 160 | Intersection of Two Linked Lists | lc160 | 写过✅ | |
| 203 | Remove Linked List Elements | |||
| 234 | Palindrome Linked List | |||
| 328 | Odd Even Linked List | |||
| 430 | Flatten a Multilevel Doubly Linked List |
5. binary tree
- 单子 94, 98, 100, 101, 102, 105, 106, 108, 110, 111, 112, 113, 114, 129, 144, 145, 173, 222, 230, 257, 297, 337, 366, 404, 450, 508, 543, 617, 652, 654, 669, 701, 783, 814, 863, 865, 889, 958
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 94 | Binary Tree Inorder Traversal | |||
| 98 | Validate Binary Search Tree | |||
| 100 | Same Tree | |||
| 101 | Symmetric Tree | |||
| 102 | Binary Tree Level Order Traversal | lc102 | 写过✅ | |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | |||
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | |||
| 108 | Convert Sorted Array to Binary Search Tree | |||
| 110 | Balanced Binary Tree | |||
| 111 | Minimum Depth of Binary Tree | |||
| 112 | Path Sum | lc112 | 写过✅ | |
| 113 | Path Sum II | |||
| 114 | Flatten Binary Tree to Linked List | |||
| 129 | Sum Root to Leaf Numbers | lc129 | 写过✅ | |
| 144 | Binary Tree Preorder Traversal | |||
| 145 | Binary Tree Postorder Traversal | |||
| 173 | Binary Search Tree Iterator | |||
| 222 | Count Complete Tree Nodes | |||
| 230 | Kth Smallest Element in a BST | |||
| 257 | Binary Tree Paths | lc257 | 写过✅ | |
| 297 | Serialize and Deserialize Binary Tree | |||
| 337 | House Robber III | |||
| 366 | Find Leaves of Binary Tree | |||
| 404 | Sum of Left Leaves | |||
| 450 | Delete Node in a BST | |||
| 508 | Most Frequent Subtree Sum | |||
| 543 | Diameter of Binary Tree | |||
| 617 | Merge Two Binary Trees | |||
| 652 | Find Duplicate Subtrees | |||
| 654 | Maximum Binary Tree | |||
| 669 | Trim a Binary Search Tree | |||
| 701 | Insert into a Binary Search Tree | |||
| 783 | Minimum Distance Between BST Nodes | |||
| 814 | Binary Tree Pruning | |||
| 863 | All Nodes Distance K in Binary Tree | |||
| 865 | Smallest Subtree with all the Deepest Nodes | |||
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | |||
| 958 | Check Completeness of a Binary Tree |
四,分组,phase 2 Graph / DFS / BFS / Union Find(约 170题)
- 单子 200, 207, 210, 261, 269, 286, 305, 310, 323, 332, 399, 417, 433, 490, 491, 529, 542, 547, 684, 695, 721, 733, 743, 752, 756, 765, 773, 778, 785, 797, 802, 815, 827, 834, 841, 847, 854, 863, 886, 909, 934, 947, 959, 980, 994, 1091, 1129, 1162, 1192, 1254, 1277, 1293, 1306, 1319, 1334, 1368, 1376, 1391, 1466, 1514, 1557, 1584, 1631, 1765, 1971, 2039, 2045, 2192, 2203, 2285, 2368
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 200 | Number of Islands | |||
| 207 | Course Schedule | |||
| 210 | Course Schedule II | |||
| 261 | Graph Valid Tree | |||
| 269 | Alien Dictionary | |||
| 286 | Walls and Gates | |||
| 305 | Number of Islands II | |||
| 310 | Minimum Height Trees | |||
| 323 | Number of Connected Components in an Undirected Graph | |||
| 332 | Reconstruct Itinerary | |||
| 399 | Evaluate Division | |||
| 417 | Pacific Atlantic Water Flow | |||
| 433 | Minimum Genetic Mutation | |||
| 490 | The Maze | |||
| 491 | Non-decreasing Subsequences | |||
| 529 | Minesweeper | |||
| 542 | 01 Matrix | |||
| 547 | Number of Provinces | |||
| 684 | Redundant Connection | |||
| 695 | Max Area of Island | |||
| 721 | Accounts Merge | |||
| 733 | Flood Fill | |||
| 743 | Network Delay Time | |||
| 752 | Open the Lock | |||
| 756 | Pyramid Transition Matrix | |||
| 765 | Couples Holding Hands | |||
| 773 | Sliding Puzzle | |||
| 778 | Swim in Rising Water | |||
| 785 | Is Graph Bipartite? | |||
| 797 | All Paths From Source to Target | |||
| 802 | Find Eventual Safe States | |||
| 815 | Bus Routes | |||
| 827 | Making A Large Island | |||
| 834 | Sum of Distances in Tree | |||
| 841 | Keys and Rooms | lc841 | 写过✅ | |
| 847 | Shortest Path Visiting All Nodes | |||
| 854 | K-Similar Strings | |||
| 863 | All Nodes Distance K in Binary Tree | |||
| 886 | Possible Bipartition | |||
| 909 | Snakes and Ladders | |||
| 934 | Shortest Bridge | |||
| 947 | Most Stones Removed with Same Row or Column | |||
| 959 | Regions Cut By Slashes | |||
| 980 | Unique Paths III | |||
| 994 | Rotting Oranges | lc994 | 写过✅ | |
| 1091 | Shortest Path in Binary Matrix | |||
| 1129 | Shortest Path with Alternating Colors | |||
| 1162 | As Far from Land as Possible | |||
| 1192 | Critical Connections in a Network | |||
| 1254 | Number of Closed Islands | |||
| 1277 | Count Square Submatrices with All Ones | |||
| 1293 | Shortest Path in a Grid with Obstacles Elimination | |||
| 1306 | Jump Game III | |||
| 1319 | Number of Operations to Make Network Connected | |||
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | |||
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | |||
| 1376 | Time Needed to Inform All Employees | |||
| 1391 | Check if There is a Valid Path in a Grid | |||
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | |||
| 1514 | Path with Maximum Probability | |||
| 1557 | Minimum Number of Vertices to Reach All Nodes | |||
| 1584 | Min Cost to Connect All Points | |||
| 1631 | Path With Minimum Effort | |||
| 1765 | Map of Highest Peak | |||
| 1971 | Find if Path Exists in Graph | |||
| 2039 | The Time When the Network Becomes Idle | |||
| 2045 | Second Minimum Time to Reach Destination | |||
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | |||
| 2203 | Minimum Weighted Subgraph With the Required Paths | |||
| 2285 | Maximum Total Importance of Roads | |||
| 2368 | Reachable Nodes With Restrictions |
五,分组,phase 3 DP / Backtracking / Greedy
- 单子 22, 31, 46, 47, 51, 52, 77, 78, 79, 90, 91, 93, 95, 96, 131, 139, 140, 198, 213, 221, 279, 300, 309, 312, 322, 377, 416, 474, 494, 518, 583, 647, 673, 698, 714, 718, 746, 790, 799, 808, 823, 837, 877, 918, 926, 931, 935, 983, 1027, 1048, 1143, 1155, 1218, 1220, 1235, 1262, 1312, 1320, 1335, 1340, 1406, 1416, 1444, 1463, 1547, 1696, 1746, 1770, 1884, 1888, 1987, 2130, 2218
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 22 | Generate Parentheses | lc022 | 写过✅ | |
| 31 | Next Permutation | |||
| 46 | Permutations | lc046 | 写过✅ | |
| 47 | Permutations II | lc047 | 写过✅ | |
| 51 | N-Queens | |||
| 52 | N-Queens II | |||
| 77 | Combinations | |||
| 78 | Subsets | |||
| 79 | Word Search | |||
| 90 | Subsets II | |||
| 91 | Decode Ways | |||
| 93 | Restore IP Addresses | |||
| 95 | Unique Binary Search Trees II | |||
| 96 | Unique Binary Search Trees | |||
| 131 | Palindrome Partitioning | |||
| 139 | Word Break | |||
| 140 | Word Break II | |||
| 198 | House Robber | lc198 | 写过✅ | |
| 213 | House Robber II | |||
| 221 | Maximal Square | |||
| 279 | Perfect Squares | |||
| 300 | Longest Increasing Subsequence | lc300 | 写过✅ | |
| 309 | Best Time to Buy and Sell Stock with Cooldown | |||
| 312 | Burst Balloons | |||
| 322 | Coin Change | lc322 | 写过✅ | |
| 377 | Combination Sum IV | |||
| 416 | Partition Equal Subset Sum | |||
| 474 | Ones and Zeroes | |||
| 494 | Target Sum | |||
| 518 | Coin Change II | |||
| 583 | Delete Operation for Two Strings | |||
| 647 | Palindromic Substrings | |||
| 673 | Number of Longest Increasing Subsequence | |||
| 698 | Partition to K Equal Sum Subsets | |||
| 714 | Best Time to Buy and Sell Stock with Transaction Fee | |||
| 718 | Maximum Length of Repeated Subarray | |||
| 746 | Min Cost Climbing Stairs | lc746 | 写过✅ | |
| 790 | Domino and Tromino Tiling | |||
| 799 | Champagne Tower | |||
| 808 | Soup Servings | |||
| 823 | Binary Trees With Factors | |||
| 837 | New 21 Game | |||
| 877 | Stone Game | |||
| 918 | Maximum Sum Circular Subarray | |||
| 926 | Flip String to Monotone Increasing | |||
| 931 | Minimum Falling Path Sum | |||
| 935 | Knight Dialer | |||
| 983 | Minimum Cost For Tickets | |||
| 1027 | Longest Arithmetic Subsequence | |||
| 1048 | Longest String Chain | |||
| 1143 | Longest Common Subsequence | lc1143 | 写过✅ | |
| 1155 | Number of Dice Rolls With Target Sum | |||
| 1218 | Longest Arithmetic Subsequence of Given Difference | |||
| 1220 | Count Vowels Permutation | |||
| 1235 | Maximum Profit in Job Scheduling | |||
| 1262 | Greatest Sum Divisible by Three | |||
| 1312 | Minimum Insertion Steps to Make a String Palindrome | |||
| 1320 | Minimum Distance to Type a Word Using Two Fingers | |||
| 1335 | Minimum Difficulty of a Job Schedule | |||
| 1340 | Jump Game V | |||
| 1406 | Stone Game III | |||
| 1416 | Restore The Array | |||
| 1444 | Number of Ways of Cutting a Pizza | |||
| 1463 | Cherry Pickup II | |||
| 1547 | Minimum Cost to Cut a Stick | |||
| 1696 | Jump Game VI | |||
| 1746 | Maximum Subarray Sum After One Operation | |||
| 1770 | Maximum Score from Performing Multiplication Operations | |||
| 1884 | Egg Drop With 2 Eggs and N Floors | |||
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | |||
| 1987 | Number of Unique Good Subsequences | |||
| 2130 | Maximum Twin Sum of a Linked List | |||
| 2218 | Maximum Value of K Coins From Piles |
六,分组 phase 4 Heap / Binary Search / Advanced
Binary Search
- 单子 4, 33, 34, 35, 74, 81, 153, 154, 162, 287, 378, 410, 436, 475, 528, 540, 611, 658, 668, 702, 704, 875, 981, 1011, 1050, 1060, 1095, 1146, 1172, 1231, 1283, 1292, 1300, 1482, 1552, 1642, 1648, 1658, 1712, 1802, 1833, 1870, 1891, 1901
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 4 | Median of Two Sorted Arrays | lc004 | 写过✅ | |
| 33 | Search in Rotated Sorted Array | |||
| 34 | Find First and Last Position of Element in Sorted Array | |||
| 35 | Search Insert Position | |||
| 74 | Search a 2D Matrix | |||
| 81 | Search in Rotated Sorted Array II | |||
| 153 | Find Minimum in Rotated Sorted Array | |||
| 154 | Find Minimum in Rotated Sorted Array II | |||
| 162 | Find Peak Element | |||
| 287 | Find the Duplicate Number | |||
| 378 | Kth Smallest Element in a Sorted Matrix | |||
| 410 | Split Array Largest Sum | |||
| 436 | Find Right Interval | |||
| 475 | Heaters | |||
| 528 | Random Pick with Weight | |||
| 540 | Single Element in a Sorted Array | |||
| 611 | Valid Triangle Number | |||
| 658 | Find K Closest Elements | |||
| 668 | Kth Smallest Number in Multiplication Table | |||
| 702 | Search in a Sorted Array of Unknown Size | |||
| 704 | Binary Search | |||
| 875 | Koko Eating Bananas | |||
| 981 | Time Based Key-Value Store | |||
| 1011 | Capacity To Ship Packages Within D Days | |||
| 1050 | Actors and Directors Who Cooperated At Least Three Times | |||
| 1060 | Missing Element in Sorted Array | |||
| 1095 | Find in Mountain Array | |||
| 1146 | Snapshot Array | |||
| 1172 | Dinner Plate Stacks | |||
| 1231 | Divide Chocolate | |||
| 1283 | Find the Smallest Divisor Given a Threshold | |||
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | |||
| 1300 | Sum of Mutated Array Closest to Target | |||
| 1482 | Minimum Number of Days to Make m Bouquets | |||
| 1552 | Magnetic Force Between Two Balls | |||
| 1642 | Furthest Building You Can Reach | |||
| 1648 | Sell Diminishing-Valued Colored Balls | |||
| 1658 | Minimum Operations to Reduce X to Zero | |||
| 1712 | Ways to Split Array Into Three Subarrays | |||
| 1802 | Maximum Value at a Given Index in a Bounded Array | |||
| 1833 | Maximum Ice Cream Bars | |||
| 1870 | Minimum Speed to Arrive on Time | |||
| 1891 | Cutting Ribbons | |||
| 1901 | Find a Peak Element II |
Heap
- 单子 215, 347, 373, 378, 480, 502, 703, 767, 786, 857, 973, 1046, 1054, 1086, 1094, 1167, 1383, 1424, 1439, 1508, 1642, 1792, 1882, 1928, 1962, 1985, 2054, 2146, 2233, 2462
| 编号 | 名字 | 简评 | 链接 | 程度 |
|---|---|---|---|---|
| 215 | Kth Largest Element in an Array | lc215 | 写过✅ | |
| 347 | Top K Frequent Elements | |||
| 373 | Find K Pairs with Smallest Sums | |||
| 378 | Kth Smallest Element in a Sorted Matrix | |||
| 480 | Sliding Window Median | |||
| 502 | IPO | |||
| 703 | Kth Largest Element in a Stream | |||
| 767 | Reorganize String | |||
| 786 | K-th Smallest Prime Fraction | |||
| 857 | Minimum Cost to Hire K Workers | |||
| 973 | K Closest Points to Origin | |||
| 1046 | Last Stone Weight | |||
| 1054 | Distant Barcodes | |||
| 1086 | High Five | |||
| 1094 | Car Pooling | |||
| 1167 | Minimum Cost to Connect Sticks | |||
| 1383 | Maximum Performance of a Team | |||
| 1424 | Diagonal Traverse II | |||
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | |||
| 1508 | Range Sum of Sorted Subarray Sums | |||
| 1642 | Furthest Building You Can Reach | |||
| 1792 | Maximum Average Pass Ratio | |||
| 1882 | Process Tasks Using Servers | |||
| 1928 | Minimum Cost to Reach Destination in Time | |||
| 1962 | Remove Stones to Minimize the Total | |||
| 1985 | Find the Kth Largest Integer in the Array | |||
| 2054 | Two Best Non-Overlapping Events | |||
| 2146 | K Highest Ranked Items Within a Price Range | |||
| 2233 | Maximum Product After K Increments | |||
| 2462 | Total Cost to Hire K Workers |