整理解题范式题目

Author: diguage

README.adoc

@@ -1617,7 +1617,7 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 
 |{counter:codes}
 |{leetcode_base_url}/basic-calculator-ii/[227. Basic Calculator II^]
-|{source_base_url}/_0227_BasicCalculatorII.java[Java]
+|{source_base_url}/_0227_BasicCalculatorIi.java[Java]
 |{doc_base_url}/0227-basic-calculator-ii.adoc[题解]
 |Medium
 |
@@ -1638,7 +1638,7 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 
 |{counter:codes}
 |{leetcode_base_url}/kth-smallest-element-in-a-bst/[230. Kth Smallest Element in a BST^]
-|{source_base_url}/_0230_KthSmallestElementInABST.java[Java]
+|{source_base_url}/_0230_KthSmallestElementInABst.java[Java]
 |{doc_base_url}/0230-kth-smallest-element-in-a-bst.adoc[题解]
 |Medium
 |
@@ -2478,7 +2478,7 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 
 |{counter:codes}
 |{leetcode_base_url}/intersection-of-two-arrays-ii/[350. Intersection of Two Arrays II^]
-|{source_base_url}/_0350_IntersectionOfTwoArraysII.java[Java]
+|{source_base_url}/_0350_IntersectionOfTwoArraysIi.java[Java]
 |{doc_base_url}/0350-intersection-of-two-arrays-ii.adoc[题解]
 |Easy
 |

docs/0000-00-note.adoc

@@ -24,7 +24,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 
 == 解题范式
 
-. Two Pointers
+. xref:0000-02-two-pointer.adoc[Two Pointer 双指针]
 .. Pair with Target Sum (easy)
 .. Find Non-Duplicate Number Instances (easy)
 .. Squaring a Sorted Array (easy)
@@ -36,49 +36,49 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem Challenge 1: Quadruple Sum to Target (medium)
 .. Problem Challenge 2: Comparing Strings containing Backspaces (medium)
 .. Problem Challenge 3: Minimum Window Sort (medium)
-. Fast & Slow Pointers
+. xref:0000-03-fast-slow-pointers.adoc[Fast & Slow Pointers 快慢指针]
 .. LinkedList Cycle (easy)
 .. Middle of the LinkedList (easy)
 .. Start of LinkedList Cycle (medium)
 .. Happy Number (medium)
 .. Problem Challenge 1: Palindrome LinkedList (medium)
 .. Problem Challenge 2: Rearrange a LinkedList (medium)
 .. Problem Challenge 3: Cycle in a Circular Array (hard)
-. Sliding Window
+. xref:0000-01-sliding-window.adoc[Sliding Window 滑动窗口]
 .. Maximum Sum Subarray of Size K  (easy)
 .. Smallest Subarray With a Greater Sum (easy)
 .. Longest Substring with K Distinct Characters (medium)
 .. Fruits into Baskets (medium)
 .. Longest Substring with Same Letters after Replacement (hard)
 .. Longest Subarray with Ones after Replacement (hard)
 .. Problem Challenge 1: Permutation in a String (hard)
-.. Problem Challenge 2: String Anagrams (hard)
+.. Problem Challenge 2: String Anagrams (hard)
 .. Problem Challenge 3: Smallest Window containing Substring (hard)
 .. Problem Challenge 4: Words Concatenation (hard)
-. Merge Intervals
+. xref:0000-04-merge-intervals.adoc[Merge Intervals 区间合并]
 .. Merge Intervals (medium)
 .. Insert Interval (medium)
 .. Intervals Intersection (medium)
 .. Conflicting Appointments (medium)
 .. Problem Challenge 1: Minimum Meeting Rooms (hard)
 .. Problem Challenge 2: Maximum CPU Load (hard)
 .. Problem Challenge 3: Employee Free Time (hard)
-. Cyclic Sort
+. xref:0000-05-cyclic-sort.adoc[Cyclic Sort 循环排序]
 .. Cyclic Sort (easy)
 .. Find the Missing Number (easy)
 .. Find all Missing Numbers (easy)
 .. Find the Duplicate Number (easy)
 .. Find all Duplicate Numbers (easy)
 .. Problem Challenge 1: Find the Corrupt Pair (easy)
-.. Problem Challenge 2: Find the Smallest Missing Positive Number (medium)
-.. Problem Challenge 3: Find the First K Missing Positive Numbers (hard)
-. In-place Reversal of a Linked List
+.. Problem Challenge 2: xref:0041-first-missing-positive.adoc[41. First Missing Positive]
+.. Problem Challenge 3: xref:1539-kth-missing-positive-number.adoc[1539. Kth Missing Positive Number]
+. xref:0000-06-reversed-list.adoc[In-place Reversal of a LinkedList 原地链表翻转]
 .. Reverse a LinkedList (easy)
 .. Reverse a Sub-list (medium)
 .. Reverse every K-element Sub-list (medium)
 .. Problem Challenge 1: Reverse alternating K-element Sub-list (medium)
 .. Problem Challenge 2: Rotate a LinkedList (medium)
-. Stacks
+. xref:0000-data-structure-stack.adoc[Stack 栈]
 .. Operations on Stack
 .. Implementing Stack Data Structure
 .. Applications of Stack
@@ -88,7 +88,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem 4: Next Greater Element
 .. Problem 5: Sorting a Stack
 .. Problem 6: Simplify Path
-. Monotonic Stack
+. xref:0000-23-monotonic-stack.adoc[Monotonic Stack 单调栈]
 .. Remove Nodes From Linked List (medium)
 .. Remove All Adjacent Duplicates In String (easy)
 .. Next Greater Element (easy)
@@ -103,7 +103,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem 3: Maximum Number of Balloons (easy)
 .. Problem 4: Longest Palindrome(easy)
 .. Problem 5: Ransom Note (easy)
-. Tree Breadth First Search
+. xref:0000-07-breadth-first-search.adoc[Breadth First Search 广度优先搜索]
 .. Binary Tree Level Order Traversal (easy)
 .. Reverse Level Order Traversal (easy)
 .. Zigzag Traversal (medium)
@@ -113,15 +113,15 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Connect Level Order Siblings (medium)
 .. Problem Challenge 1: Connect All Level Order Siblings (medium)
 .. Problem Challenge 2: Right View of a Binary Tree (easy)
-. Tree Depth First Search
+. xref:0000-08-depth-first-search.adoc[Depth First Search 深度优先搜索]
 .. Binary Tree Path Sum (easy)
 .. All Paths for a Sum (medium)
 .. Sum of Path Numbers (medium)
 .. Path With Given Sequence (medium)
 .. Count Paths for a Sum (medium)
 .. Problem Challenge 1: Tree Diameter (medium)
 .. Problem Challenge 2: Path with Maximum Sum (hard)
-. Graphs
+. xref:0000-data-structure-graph.adoc[Graph 图]
 .. Graph Representations
 .. Graph as an Abstract Data Type (ADT)
 .. Graph Traversal - Depth First Search(DFS)
@@ -137,12 +137,12 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem Challenge 1 (easy)
 .. Problem Challenge 2 (medium)
 .. Problem Challenge 3 (medium)
-. Two Heaps
+. xref:0000-09-two-heaps.adoc[Two Heaps 双堆]
 .. Find the Median of a Number Stream (medium)
 .. Sliding Window Median (hard)
 .. Maximize Capital (hard)
 .. Problem Challenge 1: Next Interval (hard)
-. Subsets
+. xref:0000-10-subsets.adoc[Subsets 子集]
 .. Subsets (easy)
 .. Subsets With Duplicates (easy)
 .. Permutations (medium)
@@ -152,7 +152,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem Challenge 1: Evaluate Expression (hard)
 .. Problem Challenge 2: Structurally Unique Binary Search Trees (hard)
 .. Problem Challenge 3: Count of Structurally Unique Binary Search Trees (hard)
-.  Modified Binary Search
+. xref:0000-11-modified-binary-search.adoc[Modified Binary Search 改造过的二分搜索]
 .. Order-agnostic Binary Search (easy)
 .. Ceiling of a Number (medium)
 .. Next Letter (medium)
@@ -168,7 +168,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Two Single Numbers (medium)
 .. Complement of Base 10 Number (medium)
 .. Problem Challenge 1: Flip and Invert an Image (hard)
-. Top 'K' Elements
+. xref:0000-12-top-k-elements.adoc[Top 'K' Elements 顶端 K 元素]
 .. Top 'K' Numbers (easy)
 .. Kth Smallest Number (easy)
 .. 'K' Closest Points to the Origin (easy)
@@ -183,41 +183,41 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem Challenge 1: Rearrange String K Distance Apart (hard)
 .. Problem Challenge 2: Scheduling Tasks (hard)
 .. Problem Challenge 3: Frequency Stack (hard)
-. Greedy Algorithms
+. xref:0000-16-greedy.adoc[Greedy Algorithms 贪心算法]
 .. Valid Palindrome II (easy)
 .. Maximum Length of Pair Chain (medium)
 .. Minimum Add to Make Parentheses Valid (medium)
 .. Remove Duplicate Letters (medium)
 .. Largest Palindromic Number (medium)
 .. Removing Minimum and Maximum From Array  (medium)
-. 0/1 Knapsack (Dynamic Programming)
+. xref:0000-21-dynamic-programming.adoc[Dynamic Programming 动态规划]
 .. 0/1 Knapsack (medium)
 .. Equal Subset Sum Partition (medium)
 .. Subset Sum (medium)
 .. Minimum Subset Sum Difference (hard)
 .. Problem Challenge 1: Count of Subset Sum (hard)
 .. Problem Challenge 2: Target Sum (hard)
-. Backtracking
+. xref:0000-15-backtrack.adoc[Backtracking 回溯]
 .. Combination Sum (medium)
 .. Word Search (medium)
 .. Factor Combinations (medium)
 .. Split a String Into the Max Number of Unique Substrings (medium)
 .. Sudoku Solver  (hard)
-. Trie
+. xref:0000-26-trie.adoc[Trie 前缀树]
 .. Implement Trie (Prefix Tree) (medium)
 .. Index Pairs of a String (easy)
 .. Design Add and Search Words Data Structure (medium)
 .. Extra Characters in a String (medium)
 .. Search Suggestions System (medium)
-. Topological Sort (Graph)
+. xref:0000-14-topological-sort.adoc[Topological Sort (Graph) 拓扑排序]
 .. Topological Sort (medium)
 .. Tasks Scheduling (medium)
 .. Tasks Scheduling Order (medium)
 .. All Tasks Scheduling Orders (hard)
 .. Alien Dictionary (hard)
 .. Problem Challenge 1: Reconstructing a Sequence (hard)
 .. Problem Challenge 2: Minimum Height Trees (hard)
-. Union Find
+. xref:0000-22-union-find-set.adoc[Union Find Set 查并集]
 .. Redundant Connection (medium)
 .. Number of Provinces (medium)
 .. Is Graph Bipartite? (medium)
@@ -227,22 +227,25 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. 132 Pattern (medium)
 .. My Calendar I (medium)
 .. Longest Continuous Subarray (medium)
-. Prefix Sum
+. xref:0000-25-prefix-sum.adoc[Prefix Sum 前缀和]
 .. Find the Middle Index in Array (easy)
 .. Left and Right Sum Differences (easy)
 .. Maximum Size Subarray Sum Equals k (medium)
 .. Binary Subarrays With Sum (medium)
 .. Subarray Sums Divisible by K (medium)
 .. Sum of Absolute Differences in a Sorted Array (medium)
 .. Subarray Sum Equals K (medium)
+. xref:0000-24-difference-array.adoc[Difference Array 差分数组]
 . Multi-threaded
 .. Same Tree (medium)
 .. Invert Binary Tree (medium)
 .. Binary Search Tree Iterator (medium)
+. xref:0000-13-k-way-merge.adoc[K-way merge 多路归并]
 
 
 == 参考资料
 
 . https://www.designgurus.io/course/grokking-the-coding-interview[Grokking the Coding Interview Patterns^]
 . https://leetcode.ca/all/1650.html[Leetcode 1650. Lowest Common Ancestor of a Binary Tree III^] -- 会员题目可以在这里查找。
 . https://github.com/doocs/leetcode[doocs/leetcode: 🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解^] -- 也可以在这里找题目
+. https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews[Several Coding Patterns for Solving Data Structures and Algorithms Problems during Interviews^] -- 多种解题范式总结

docs/0000-01-sliding-window.adoc

@@ -1,5 +1,5 @@
 [#0000-01-sliding-window]
-= 滑动窗口算法
+= Sliding Window 滑动窗口
 
 滑动窗口类型的题目经常是用来执行数组或是链表上某个区间（窗口）上的操作。比如找最长的全为1的子数组长度。滑动窗口一般从第一个元素开始，一直往右边一个一个元素挪动。当然了，根据题目要求，我们可能有固定窗口大小的情况，也有窗口的大小变化的情况。
 
@@ -14,35 +14,36 @@ Maximum Sum Subarray of Size K (easy)
 
 Smallest Subarray with a given sum (easy)
 
-Longest Substring with K Distinct Characters (medium)
-
-Fruits into Baskets (medium)
-
 No-repeat Substring (hard)
 
 Longest Substring with Same Letters after Replacement (hard)
 
 Longest Subarray with Ones after Replacement (hard)
 
-
-. xref:0239-sliding-window-maximum.adoc[239. Sliding Window Maximum (hard)]
-. xref:0480-sliding-window-median.adoc[480. Sliding Window Median (hard)]
 . xref:0003-longest-substring-without-repeating-characters.adoc[3. Longest Substring Without Repeating Characters (medium)]
+. xref:0030-substring-with-concatenation-of-all-words.adoc[30. Substring with Concatenation of All Words]
 . xref:0076-minimum-window-substring.adoc[76. Minimum Window Substring (hard)]
-. xref:0395-longest-substring-with-at-least-k-repeating-characters.adoc[395. Longest Substring with At Least K Repeating Characters (medium)]
-. xref:0567-permutation-in-string.adoc[567. Permutation in String (medium)]
-. xref:0438-find-all-anagrams-in-a-string.adoc[438. Find All Anagrams in a String (medium)]
+. xref:0159-longest-substring-with-at-most-two-distinct-characters.adoc[159. Longest Substring with At Most Two Distinct Characters]
 . xref:0209-minimum-size-subarray-sum.adoc[209. Minimum Size Subarray Sum (medium)]
+. xref:0239-sliding-window-maximum.adoc[239. Sliding Window Maximum (hard)]
+. xref:0340-longest-substring-with-at-most-k-distinct-characters.adoc[340. Longest Substring with At Most K Distinct Characters]
+. xref:0395-longest-substring-with-at-least-k-repeating-characters.adoc[395. Longest Substring with At Least K Repeating Characters (medium)]
 . xref:0424-longest-repeating-character-replacement.adoc[424. Longest Repeating Character Replacement (medium)]
+. xref:0438-find-all-anagrams-in-a-string.adoc[438. Find All Anagrams in a String (medium)]
+. xref:0480-sliding-window-median.adoc[480. Sliding Window Median (hard)]
+. xref:0567-permutation-in-string.adoc[567. Permutation in String (medium)]
+. xref:0643-maximum-average-subarray-i.adoc[643. Maximum Average Subarray I]
 . xref:0713-subarray-product-less-than-k.adoc[713. Subarray Product Less Than K]
-. xref:1208-get-equal-substrings-within-budget.adoc[1208. Get Equal Substrings Within Budget (medium)]
-. xref:0904-fruit-into-baskets.adoc[904. Fruit Into Baskets (medium)]
+. xref:0904-fruit-into-baskets.adoc[904. Fruit Into Baskets]
 . xref:0978-longest-turbulent-subarray.adoc[978. Longest Turbulent Subarray]
 . xref:0992-subarrays-with-k-different-integers.adoc[992. Subarrays with K Different Integers]
 . xref:0995-minimum-number-of-k-consecutive-bit-flips.adoc[995. Minimum Number of K Consecutive Bit Flips]
+. xref:1004-max-consecutive-ones-iii.adoc[1004. Max Consecutive Ones III]
 . xref:1040-moving-stones-until-consecutive-ii.adoc[1040. Moving Stones Until Consecutive II]
 . xref:1052-grumpy-bookstore-owner.adoc[1052. Grumpy Bookstore Owner]
 . xref:1074-number-of-submatrices-that-sum-to-target.adoc[1074. Number of Submatrices That Sum to Target]
+. xref:1208-get-equal-substrings-within-budget.adoc[1208. Get Equal Substrings Within Budget (medium)]
+. xref:1708-largest-subarray-length-k.adoc[1708. Largest Subarray Length K]
 
 == 整体思路
 

docs/0000-02-two-pointer.adoc

@@ -1,5 +1,5 @@
 [#0000-02-two-pointer]
-= Two Pointer
+= Two Pointer 双指针
 
 双指针是这样的模式：两个指针朝着左右方向移动（双指针分为同向双指针和异向双指针），直到他们有一个或是两个都满足某种条件。双指针通常用在排好序的数组或是链表中寻找对子。比如，你需要去比较数组中每个元素和其他元素的关系时，你就需要用到双指针了。
 
@@ -12,11 +12,7 @@
 
 == 经典题目
 
-Pair with Target Sum (easy)
 
-Remove Duplicates (easy)
-
-Squaring a Sorted Array (easy)
 
 Triplet Sum to Zero (medium)
 
@@ -28,19 +24,30 @@ Subarrays with Product Less than a Target (medium)
 
 Dutch National Flag Problem (medium)
 
+. xref:0001-two-sum.adoc[1. Two Sum]
+. xref:0015-3sum.adoc[15. 3Sum]
+. xref:0016-3sum-closest.adoc[16. 3Sum Closest]
+. xref:0018-4sum.adoc[18. 4Sum]
+. xref:0026-remove-duplicates-from-sorted-array.adoc[26. Remove Duplicates from Sorted Array]
+. xref:0027-remove-element.adoc[27. Remove Element]
 . xref:0032-longest-valid-parentheses.adoc[32. Longest Valid Parentheses]
+. xref:0075-sort-colors.adoc[75. Sort Colors]
 . xref:0076-minimum-window-substring.adoc[76. Minimum Window Substring]
 . xref:0109-convert-sorted-list-to-binary-search-tree.adoc[109. Convert Sorted List to Binary Search Tree]
 . xref:0209-minimum-size-subarray-sum.adoc[209. Minimum Size Subarray Sum]
 . xref:0239-sliding-window-maximum.adoc[239. Sliding Window Maximum]
+. xref:0259-3sum-smaller.adoc[259. 3Sum Smaller]
 . xref:0424-longest-repeating-character-replacement.adoc[424. Longest Repeating Character Replacement]
 . xref:0438-find-all-anagrams-in-a-string.adoc[438. Find All Anagrams in a String]
 . xref:0567-permutation-in-string.adoc[567. Permutation in String]
 . xref:0713-subarray-product-less-than-k.adoc[713. Subarray Product Less Than K]
 . xref:0763-partition-labels.adoc[763. Partition Labels]
 . xref:0799-champagne-tower.adoc[799. Champagne Tower]
+. xref:0844-backspace-string-compare.adoc[844. Backspace String Compare]
 . xref:0962-maximum-width-ramp.adoc[962. Maximum Width Ramp]
+. xref:0977-squares-of-a-sorted-array.adoc[977. Squares of a Sorted Array]
 . xref:1124-longest-well-performing-interval.adoc[1124. Longest Well-Performing Interval]
+. xref:1574-shortest-subarray-to-be-removed-to-make-array-sorted.adoc[1574. Shortest Subarray to be Removed to Make Array Sorted]
 
 
 == 参考资料

docs/0000-03-fast-slow-pointers.adoc

@@ -1,5 +1,5 @@
 [#0000-03-fast-slow-pointers]
-= Fast & Slow pointers, 快慢指针类型
+= Fast & Slow Pointers 快慢指针
 
 这种模式，有一个非常出门的名字，叫龟兔赛跑。咱们肯定都知道龟兔赛跑啦。但还是再解释一下快慢指针：这种算法的两个指针的在数组上（或是链表上，序列上）的移动速度不一样。还别说，这种方法在解决有环的链表和数组时特别有用。
 
@@ -21,3 +21,13 @@ Start of LinkedList Cycle (medium)
 Happy Number (medium)
 
 Middle of the LinkedList (easy)
+
+== 经典题目
+
+. xref:0141-linked-list-cycle.adoc[141. Linked List Cycle]
+. xref:0142-linked-list-cycle-ii.adoc[142. Linked List Cycle II]
+. xref:0143-reorder-list.adoc[143. Reorder List]
+. xref:0202-happy-number.adoc[202. Happy Number]
+. xref:0234-palindrome-linked-list.adoc[234. Palindrome Linked List]
+. xref:0457-circular-array-loop.adoc[457. Circular Array Loop]
+. xref:0876-middle-of-the-linked-list.adoc[876. Middle of the Linked List]

docs/0000-04-merge-intervals.adoc

@@ -1,5 +1,5 @@
 [#0000-04-merge-intervals]
-= Merge Intervals，区间合并类型
+= Merge Intervals 区间合并
 
 
 区间合并模式是一个用来处理有区间重叠的很高效的技术。在设计到区间的很多问题中，通常咱们需要要么判断是否有重叠，要么合并区间，如果他们重叠的话。这个模式是这么起作用的：
@@ -11,11 +11,15 @@
 * 当你需要产生一堆相互之间没有交集的区间的时候
 * 当你听到重叠区间的时候
 
+== 经典题目
 
-Merge Intervals (medium)
+. xref:0056-merge-intervals.adoc[56. Merge Intervals]
+. xref:0057-insert-interval.adoc[57. Insert Interval]
+. xref:0986-interval-list-intersections.adoc[986. Interval List Intersections]
+. xref:0252-meeting-rooms.adoc[252. Meeting Rooms]
+. xref:0253-meeting-rooms-ii.adoc[253. Meeting Rooms II]
+. xref:0759-employee-free-time.adoc[759. Employee Free Time]
+. xref:1094-car-pooling.adoc[1094. Car Pooling]
 
-Insert Interval (medium)
-
-Intervals Intersection (medium)
 
 Conflicting Appointments (medium)