优化文档

Author: diguage

docs/0000-01-sliding-window.adoc

@@ -1,5 +1,5 @@
 [#0000-01-sliding-window]
-== 滑动窗口算法
+= 滑动窗口算法
 
 滑动窗口类型的题目经常是用来执行数组或是链表上某个区间（窗口）上的操作。比如找最长的全为1的子数组长度。滑动窗口一般从第一个元素开始，一直往右边一个一个元素挪动。当然了，根据题目要求，我们可能有固定窗口大小的情况，也有窗口的大小变化的情况。
 
@@ -25,39 +25,23 @@ Longest Substring with Same Letters after Replacement (hard)
 Longest Subarray with Ones after Replacement (hard)
 
 
-LeetCode 239. Sliding Window Maximum (hard)
-
-LeetCode 480. Sliding Window Median (hard)
-
-LeetCode 3. Longest Substring Without Repeating Characters (medium)
-
-LeetCode 76. Minimum Window Substring (hard)
-
-LeetCode 395. Longest Substring with At Least K Repeating Characters (medium)
-
-LeetCode 567. Permutation in String (medium)
-
-LeetCode 438. Find All Anagrams in a String (medium)
-
-LeetCode 209. Minimum Size Subarray Sum (medium)
-
-LeetCode 424. Longest Repeating Character Replacement (medium)
-
-LeetCode 1208. Get Equal Substrings Within Budget (medium)
-
-LeetCode 904. Fruit Into Baskets (medium)
-
-LeetCode 978. Longest Turbulent Subarray (medium)
-
-LeetCode 992. Subarrays with K Different Integers (hard)
-
-LeetCode 995. Minimum Number of K Consecutive Bit Flips (hard)
-
-LeetCode 1040. Moving Stones Until Consecutive II (medium)
-
-LeetCode 1052. Grumpy Bookstore Owner (medium)
-
-LeetCode 1074. Number of Submatrices That Sum to Target (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: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:0209-minimum-size-subarray-sum.adoc[209. Minimum Size Subarray Sum (medium)]
+. xref:0424-longest-repeating-character-replacement.adoc[424. Longest Repeating Character Replacement (medium)]
+. 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: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: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]
 
 == 整体思路
 

docs/0003-longest-substring-without-repeating-characters.adoc

@@ -1,3 +1,5 @@
+
+[#0003-longest-substring-without-repeating-characters]
 = 3. Longest Substring Without Repeating Characters
 
 https://leetcode.com/problems/longest-substring-without-repeating-characters/[LeetCode - Longest Substring Without Repeating Characters]

docs/0076-minimum-window-substring.adoc

@@ -1,3 +1,4 @@
+[#0076-minimum-window-substring]
 = 76. Minimum Window Substring
 
 https://leetcode.com/problems/minimum-window-substring/[LeetCode - Minimum Window Substring]

docs/0209-minimum-size-subarray-sum.adoc

@@ -1,3 +1,4 @@
+[#0209-minimum-size-subarray-sum]
 = 209. Minimum Size Subarray Sum
 
 https://leetcode.com/problems/minimum-size-subarray-sum/[LeetCode - Minimum Size Subarray Sum]

docs/0239-sliding-window-maximum.adoc

@@ -1,3 +1,4 @@
+[#0239-sliding-window-maximum]
 = 239. Sliding Window Maximum
 
 https://leetcode.com/problems/sliding-window-maximum/[LeetCode - Sliding Window Maximum]

docs/0395-longest-substring-with-at-least-k-repeating-characters.adoc

@@ -1,3 +1,4 @@
+[#0395-longest-substring-with-at-least-k-repeating-characters]
 = 395. Longest Substring with At Least K Repeating Characters
 
 https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/[LeetCode - Longest Substring with At Least K Repeating Characters]

docs/0424-longest-repeating-character-replacement.adoc

@@ -1,3 +1,4 @@
+[#0424-longest-repeating-character-replacement]
 = 424. Longest Repeating Character Replacement
 
 https://leetcode.com/problems/longest-repeating-character-replacement/[LeetCode - Longest Repeating Character Replacement]

docs/0438-find-all-anagrams-in-a-string.adoc

@@ -1,3 +1,4 @@
+[#0438-find-all-anagrams-in-a-string]
 = 438. Find All Anagrams in a String
 
 https://leetcode.com/problems/find-all-anagrams-in-a-string/[LeetCode - Find All Anagrams in a String]

docs/0480-sliding-window-median.adoc

@@ -1,3 +1,4 @@
+[#0480-sliding-window-median]
 = 480. Sliding Window Median
 
 https://leetcode.com/problems/sliding-window-median/[LeetCode - Sliding Window Median]

docs/0567-permutation-in-string.adoc

@@ -1,3 +1,4 @@
+[#0567-permutation-in-string]
 = 567. Permutation in String
 
 https://leetcode.com/problems/permutation-in-string/[LeetCode - Permutation in String]