调整算法模式顺序

diguage · diguage · commit d2c08f64a0b1 · 2025-03-25T21:13:44.000+08:00
diff --git a/docs/0000-00-note.adoc b/docs/0000-00-note.adoc
@@ -52,7 +52,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem Challenge 1: Palindrome LinkedList (medium)
 .. Problem Challenge 2: Rearrange a LinkedList (medium)
 .. Problem Challenge 3: Cycle in a Circular Array (hard)
-. xref:0000-08-sliding-window.adoc[Sliding Window 滑动窗口]
+. xref:0000-09-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)
@@ -71,7 +71,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem Challenge 1: Minimum Meeting Rooms (hard)
 .. Problem Challenge 2: Maximum CPU Load (hard)
 .. Problem Challenge 3: Employee Free Time (hard)
-. xref:0000-11-cyclic-sort.adoc[Cyclic Sort 循环排序]
+. xref:0000-12-cyclic-sort.adoc[Cyclic Sort 循环排序]
 .. Cyclic Sort (easy)
 .. Find the Missing Number (easy)
 .. Find all Missing Numbers (easy)
@@ -96,7 +96,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem 4: Next Greater Element
 .. Problem 5: Sorting a Stack
 .. Problem 6: Simplify Path
-. xref:0000-09-monotonic-stack.adoc[Monotonic Stack 单调栈]
+. xref:0000-10-monotonic-stack.adoc[Monotonic Stack 单调栈]
 .. Remove Nodes From Linked List (medium)
 .. Remove All Adjacent Duplicates In String (easy)
 .. Next Greater Element (easy)
@@ -111,7 +111,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)
-. xref:0000-14-breadth-first-search.adoc[Breadth First Search 广度优先搜索]
+. xref:0000-15-breadth-first-search.adoc[Breadth First Search 广度优先搜索]
 .. Binary Tree Level Order Traversal (easy)
 .. Reverse Level Order Traversal (easy)
 .. Zigzag Traversal (medium)
@@ -121,7 +121,7 @@ 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)
-. xref:0000-15-depth-first-search.adoc[Depth First Search 深度优先搜索]
+. xref:0000-16-depth-first-search.adoc[Depth First Search 深度优先搜索]
 .. Binary Tree Path Sum (easy)
 .. All Paths for a Sum (medium)
 .. Sum of Path Numbers (medium)
@@ -145,7 +145,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Problem Challenge 1 (easy)
 .. Problem Challenge 2 (medium)
 .. Problem Challenge 3 (medium)
-. xref:0000-12-two-heaps.adoc[Two Heaps 双堆]
+. xref:0000-13-two-heaps.adoc[Two Heaps 双堆]
 .. Find the Median of a Number Stream (medium)
 .. Sliding Window Median (hard)
 .. Maximize Capital (hard)
@@ -176,7 +176,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)
-. xref:0000-10-top-k-elements.adoc[Top 'K' Elements 顶端 K 元素]
+. xref:0000-11-top-k-elements.adoc[Top 'K' Elements 顶端 K 元素]
 .. Top 'K' Numbers (easy)
 .. Kth Smallest Number (easy)
 .. 'K' Closest Points to the Origin (easy)
@@ -211,21 +211,21 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Factor Combinations (medium)
 .. Split a String Into the Max Number of Unique Substrings (medium)
 .. Sudoku Solver  (hard)
-. xref:0000-16-trie.adoc[Trie 前缀树]
+. xref:0000-17-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)
-. xref:0000-18-topological-sort.adoc[Topological Sort (Graph) 拓扑排序]
+. xref:0000-19-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)
-. xref:0000-17-union-find-set.adoc[Union Find Set 查并集]
+. xref:0000-18-union-find-set.adoc[Union Find Set 查并集]
 .. Redundant Connection (medium)
 .. Number of Provinces (medium)
 .. Is Graph Bipartite? (medium)
@@ -248,7 +248,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Same Tree (medium)
 .. Invert Binary Tree (medium)
 .. Binary Search Tree Iterator (medium)
-. xref:0000-13-k-way-merge.adoc[K-way merge 多路归并]
+. xref:0000-14-k-way-merge.adoc[K-way merge 多路归并]
 
 
 == 参考资料
diff --git a/docs/0000-09-sliding-window.adoc b/docs/0000-09-sliding-window.adoc
@@ -1,4 +1,4 @@
-[#0000-08-sliding-window]
+[#0000-09-sliding-window]
 = Sliding Window 滑动窗口
 
 滑动窗口类型的题目经常是用来执行数组或是链表上某个区间（窗口）上的操作。比如找最长的全为1的子数组长度。滑动窗口一般从第一个元素开始，一直往右边一个一个元素挪动。当然了，根据题目要求，我们可能有固定窗口大小的情况，也有窗口的大小变化的情况。
diff --git a/docs/0000-10-monotonic-stack.adoc b/docs/0000-10-monotonic-stack.adoc
@@ -1,4 +1,4 @@
-[#0000-09-monotonic-stack]
+[#0000-10-monotonic-stack]
 = Monotonic Stack 单调栈
 
 == 基本流程
diff --git a/docs/0000-11-top-k-elements.adoc b/docs/0000-11-top-k-elements.adoc
@@ -1,5 +1,5 @@
-[#0000-10-top-k-elements]
-= Top 'K' Elements 顶端 K 元素
+[#0000-11-top-k-elements]
+= Top `K` Elements 顶端 K 元素
 
 任何让我们求解最大/最小/最频繁的K个元素的题，都遵循这种模式。
 
diff --git a/docs/0000-12-cyclic-sort.adoc b/docs/0000-12-cyclic-sort.adoc
@@ -1,4 +1,4 @@
-[#0000-11-cyclic-sort]
+[#0000-12-cyclic-sort]
 = Cyclic Sort 循环排序
 
 这种模式讲述的是一直很好玩的方法：可以用来处理数组中的数值限定在一定的区间的问题。这种模式一个个遍历数组中的元素，如果当前这个数它不在其应该在的位置的话，咱们就把它和它应该在的那个位置上的数交换一下。你可以尝试将该数放到其正确的位置上，但这复杂度就会是O(n^2^)。这样的话，可能就不是最优解了。因此循环排序的优势就体现出来了。
diff --git a/docs/0000-13-two-heaps.adoc b/docs/0000-13-two-heaps.adoc
@@ -1,4 +1,4 @@
-[#0000-12-two-heaps]
+[#0000-13-two-heaps]
 = Two Heaps 双堆
 
 很多问题中，我们被告知，我们拿到一大把可以分成两队的数字。为了解决这个问题，我们感兴趣的是，怎么把数字分成两半？使得：小的数字都放在一起，大的放在另外一半。双堆模式就能高效解决此类问题。
diff --git a/docs/0000-14-k-way-merge.adoc b/docs/0000-14-k-way-merge.adoc
@@ -1,4 +1,4 @@
-[#0000-13-k-way-merge]
+[#0000-14-k-way-merge]
 = K-way merge 多路归并
 
 K路归并能帮咱们解决那些涉及到多组排好序的数组的问题。
diff --git a/docs/0000-15-breadth-first-search.adoc b/docs/0000-15-breadth-first-search.adoc
@@ -1,4 +1,4 @@
-[#0000-14-breadth-first-search]
+[#0000-15-breadth-first-search]
 = Breadth First Search 广度优先搜索
 
 == Tree Breadth First Search，树上的BFS
diff --git a/docs/0000-16-depth-first-search.adoc b/docs/0000-16-depth-first-search.adoc
@@ -1,4 +1,4 @@
-[#0000-15-depth-first-search]
+[#0000-16-depth-first-search]
 = Depth First Search 深度优先搜索
 
 == Tree Depth First Search，树上的DFS
diff --git a/docs/0000-17-trie.adoc b/docs/0000-17-trie.adoc
@@ -1,4 +1,4 @@
-[#0000-16-trie]
+[#0000-17-trie]
 = Trie 前缀树
 
 
diff --git a/docs/0000-18-union-find-set.adoc b/docs/0000-18-union-find-set.adoc
@@ -1,4 +1,4 @@
-[#0000-17-union-find-set]
+[#0000-18-union-find-set]
 = Union Find Set 查并集
 
 
diff --git a/docs/0000-19-topological-sort.adoc b/docs/0000-19-topological-sort.adoc
@@ -1,4 +1,4 @@
-[#0000-18-topological-sort]
+[#0000-19-topological-sort]
 = Topological Sort (Graph) 拓扑排序
 
 拓扑排序模式用来寻找一种线性的顺序，这些元素之间具有依懒性。比如，如果事件B依赖于事件A，那A在拓扑排序顺序中排在B的前面。
diff --git a/docs/0000-20-brute-force.adoc b/docs/0000-20-brute-force.adoc
@@ -1,4 +1,4 @@
-[#0000-19-brute-force]
+[#0000-20-brute-force]
 = Brute Force 暴力破解
 
 选择排序，冒泡排序，在有序数组中的顺序查找等等都属于暴力破解的解法。
diff --git a/docs/0000-21-decrease-and-conquer.adoc b/docs/0000-21-decrease-and-conquer.adoc
@@ -1,3 +1,3 @@
-[#0000-20-decrease-and-conquer]
+[#0000-21-decrease-and-conquer]
 = Decrease and Conquer 减治法
 
diff --git a/docs/0000-data-structure-list.adoc b/docs/0000-data-structure-list.adoc
@@ -13,7 +13,7 @@
 
 === 单调栈
 
-详情见 xref:0000-09-monotonic-stack.adoc[Monotonic Stack 单调栈]
+详情见 xref:0000-10-monotonic-stack.adoc[Monotonic Stack 单调栈]
 
 === 其他技巧
 
diff --git a/docs/index.adoc b/docs/index.adoc
@@ -38,31 +38,31 @@ include::0000-07-fast-slow-pointers.adoc[leveloffset=+1]
 
 include::0000-08-quickselect.adoc[leveloffset=+1]
 
-include::0000-08-sliding-window.adoc[leveloffset=+1]
+include::0000-09-sliding-window.adoc[leveloffset=+1]
 
-include::0000-09-monotonic-stack.adoc[leveloffset=+1]
+include::0000-10-monotonic-stack.adoc[leveloffset=+1]
 
-include::0000-10-top-k-elements.adoc[leveloffset=+1]
+include::0000-11-top-k-elements.adoc[leveloffset=+1]
 
-include::0000-11-cyclic-sort.adoc[leveloffset=+1]
+include::0000-12-cyclic-sort.adoc[leveloffset=+1]
 
-include::0000-12-two-heaps.adoc[leveloffset=+1]
+include::0000-13-two-heaps.adoc[leveloffset=+1]
 
-include::0000-13-k-way-merge.adoc[leveloffset=+1]
+include::0000-14-k-way-merge.adoc[leveloffset=+1]
 
-include::0000-14-breadth-first-search.adoc[leveloffset=+1]
+include::0000-15-breadth-first-search.adoc[leveloffset=+1]
 
-include::0000-15-depth-first-search.adoc[leveloffset=+1]
+include::0000-16-depth-first-search.adoc[leveloffset=+1]
 
-include::0000-16-trie.adoc[leveloffset=+1]
+include::0000-17-trie.adoc[leveloffset=+1]
 
-include::0000-17-union-find-set.adoc[leveloffset=+1]
+include::0000-18-union-find-set.adoc[leveloffset=+1]
 
-include::0000-18-topological-sort.adoc[leveloffset=+1]
+include::0000-19-topological-sort.adoc[leveloffset=+1]
 
-include::0000-19-brute-force.adoc[leveloffset=+1]
+include::0000-20-brute-force.adoc[leveloffset=+1]
 
-include::0000-20-decrease-and-conquer.adoc[leveloffset=+1]
+include::0000-21-decrease-and-conquer.adoc[leveloffset=+1]
 
 include::0000-21-divide-and-conquer.adoc[leveloffset=+1]
 

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-[#0000-08-sliding-window]`
	`1`	`+[#0000-09-sliding-window]`
`2`	`2`	`= Sliding Window 滑动窗口`
`3`	`3`
`4`	`4`	`滑动窗口类型的题目经常是用来执行数组或是链表上某个区间（窗口）上的操作。比如找最长的全为1的子数组长度。滑动窗口一般从第一个元素开始，一直往右边一个一个元素挪动。当然了，根据题目要求，我们可能有固定窗口大小的情况，也有窗口的大小变化的情况。`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-[#0000-09-monotonic-stack]`
	`1`	`+[#0000-10-monotonic-stack]`
`2`	`2`	`= Monotonic Stack 单调栈`
`3`	`3`
`4`	`4`	`== 基本流程`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-[#0000-11-cyclic-sort]`
	`1`	`+[#0000-12-cyclic-sort]`
`2`	`2`	`= Cyclic Sort 循环排序`
`3`	`3`
`4`	`4`	`这种模式讲述的是一直很好玩的方法：可以用来处理数组中的数值限定在一定的区间的问题。这种模式一个个遍历数组中的元素，如果当前这个数它不在其应该在的位置的话，咱们就把它和它应该在的那个位置上的数交换一下。你可以尝试将该数放到其正确的位置上，但这复杂度就会是O(n^2^)。这样的话，可能就不是最优解了。因此循环排序的优势就体现出来了。`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-[#0000-12-two-heaps]`
	`1`	`+[#0000-13-two-heaps]`
`2`	`2`	`= Two Heaps 双堆`
`3`	`3`
`4`	`4`	`很多问题中，我们被告知，我们拿到一大把可以分成两队的数字。为了解决这个问题，我们感兴趣的是，怎么把数字分成两半？使得：小的数字都放在一起，大的放在另外一半。双堆模式就能高效解决此类问题。`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-[#0000-13-k-way-merge]`
	`1`	`+[#0000-14-k-way-merge]`
`2`	`2`	`= K-way merge 多路归并`
`3`	`3`
`4`	`4`	`K路归并能帮咱们解决那些涉及到多组排好序的数组的问题。`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-[#0000-14-breadth-first-search]`
	`1`	`+[#0000-15-breadth-first-search]`
`2`	`2`	`= Breadth First Search 广度优先搜索`
`3`	`3`
`4`	`4`	`== Tree Breadth First Search，树上的BFS`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-[#0000-15-depth-first-search]`
	`1`	`+[#0000-16-depth-first-search]`
`2`	`2`	`= Depth First Search 深度优先搜索`
`3`	`3`
`4`	`4`	`== Tree Depth First Search，树上的DFS`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-[#0000-16-trie]`
	`1`	`+[#0000-17-trie]`
`2`	`2`	`= Trie 前缀树`
`3`	`3`
`4`	`4`