优化章节结构

Author: diguage

docs/0000-00-note.adoc

@@ -58,7 +58,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-09-sliding-window.adoc[Sliding Window 滑动窗口]
+. xref:0000-08-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)
@@ -102,7 +102,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-10-monotonic-stack.adoc[Monotonic Stack 单调栈]
+. xref:0000-11-monotonic-stack.adoc[Monotonic Stack 单调栈]
 .. Remove Nodes From Linked List (medium)
 .. Remove All Adjacent Duplicates In String (easy)
 .. Next Greater Element (easy)
@@ -182,7 +182,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-11-top-k-elements.adoc[Top 'K' Elements 顶端 K 元素]
+. xref:0000-10-top-k-elements.adoc[Top 'K' Elements 顶端 K 元素]
 .. Top 'K' Numbers (easy)
 .. Kth Smallest Number (easy)
 .. 'K' Closest Points to the Origin (easy)

docs/0000-09-sliding-window.adoc docs/0000-08-sliding-window.adocdocs/0000-09-sliding-window.adoc renamed to docs/0000-08-sliding-window.adoc

@@ -1,4 +1,4 @@
-[#0000-09-sliding-window]
+[#0000-08-sliding-window]
 = Sliding Window 滑动窗口
 
 滑动窗口类型的题目经常是用来执行数组或是链表上某个区间（窗口）上的操作。比如找最长的全为1的子数组长度。滑动窗口一般从第一个元素开始，一直往右边一个一个元素挪动。当然了，根据题目要求，我们可能有固定窗口大小的情况，也有窗口的大小变化的情况。

docs/0000-08-quickselect.adoc docs/0000-09-quickselect.adocdocs/0000-08-quickselect.adoc renamed to docs/0000-09-quickselect.adoc

@@ -1,4 +1,4 @@
-[#0000-08-quickselect]
+[#0000-09-quickselect]
 = QuickSelect 快速选择
 
 快速选择起源于快排算法。在快排算法中，把元素根据基准元素分成左右两部分，一边的元素小于基准元素，另外一个的元素大于等于基准元素，再对两边的元素递归处理，最终得到有序结果。受此启发，在将元素根据基准元素分成左右两部分后，这里假设，左边小于基准元素，右边大于等于基准元素，那么会有如下三种情况：
@@ -7,7 +7,7 @@
 . 当前基准元素所在位置小于 K，那么 K 位置在当前基准元素的右边；
 . 当前基准元素所在位置大于 K，那么 K 位置在当前基准元素的左边；
 
-所以，该模式不仅适用于求第 K 个之最元素，也适用于求 xref:0000-11-top-k-elements.adoc[Top `K` Elements Top K 元素]。
+所以，该模式不仅适用于求第 K 个之最元素，也适用于求 xref:0000-10-top-k-elements.adoc[Top `K` Elements Top K 元素]。
 
 WARNING: 快速选择！背也要背下来！！！！
 

docs/0000-11-top-k-elements.adoc docs/0000-10-top-k-elements.adocdocs/0000-11-top-k-elements.adoc renamed to docs/0000-10-top-k-elements.adoc

@@ -1,4 +1,4 @@
-[#0000-11-top-k-elements]
+[#0000-10-top-k-elements]
 = Top `K` Elements Top K 元素
 
 任何让我们求解最大/最小/最频繁的K个元素的题，都遵循这种模式。
@@ -20,7 +20,7 @@
 此类“Top K 元素”问题，大概有三种解题思路：
 
 . Top K 元素
-. xref:0000-08-quickselect.adoc[QuickSelect 快速选择]
+. xref:0000-09-quickselect.adoc[QuickSelect 快速选择]
 . <<0000-bucket-sort>> -- 一些特殊情况也可以使用 <<0000-bucket-sort>> 来解决，例如： xref:0347-top-k-frequent-elements.adoc[347. 前 K 个高频元素]。
 
 == 经典题目

docs/0000-10-monotonic-stack.adoc docs/0000-11-monotonic-stack.adocdocs/0000-10-monotonic-stack.adoc renamed to docs/0000-11-monotonic-stack.adoc

@@ -1,4 +1,4 @@
-[#0000-10-monotonic-stack]
+[#0000-11-monotonic-stack]
 = Monotonic Stack 单调栈
 
 == 基本流程

docs/0000-data-structure-list.adoc

@@ -17,7 +17,7 @@
 
 === 单调栈
 
-详情见 xref:0000-10-monotonic-stack.adoc[Monotonic Stack 单调栈]
+详情见 xref:0000-11-monotonic-stack.adoc[Monotonic Stack 单调栈]
 
 === 其他技巧
 

docs/index.adoc

@@ -49,13 +49,13 @@ include::0000-06-two-pointer.adoc[leveloffset=+1]
 
 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-quickselect.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-monotonic-stack.adoc[leveloffset=+1]
 
 include::0000-12-cyclic-sort.adoc[leveloffset=+1]