调整目录结构

Author: diguage

docs/0000-00-note.adoc

@@ -205,7 +205,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 .. Minimum Subset Sum Difference (hard)
 .. Problem Challenge 1: Count of Subset Sum (hard)
 .. Problem Challenge 2: Target Sum (hard)
-. xref:0000-23-backtrack.adoc[Backtracking 回溯]
+. xref:0000-24-backtrack.adoc[Backtracking 回溯]
 .. Combination Sum (medium)
 .. Word Search (medium)
 .. Factor Combinations (medium)

docs/0000-21-divide-and-conquer.adoc renamed to docs/0000-22-divide-and-conquer.adoc

@@ -1,4 +1,4 @@
-[#0000-21-divide-and-conquer]
+[#0000-22-divide-and-conquer]
 = Divide and Conquer 分治法
 
 == 经典题目

docs/0000-22-transform-and-conquer.adoc renamed to docs/0000-23-transform-and-conquer.adoc

@@ -1,2 +1,2 @@
-[#0000-22-transform-and-conquer]
+[#0000-23-transform-and-conquer]
 = Transform and Conquer 变知法

docs/0000-23-backtrack.adoc renamed to docs/0000-24-backtrack.adoc

@@ -1,4 +1,4 @@
-[#0000-23-backtrack]
+[#0000-24-backtrack]
 = Backtracking 回溯
 
 参考 xref:0046-permutations.adoc[46. Permutations] 认真学习一下回溯思想。

docs/index.adoc

@@ -64,11 +64,11 @@ include::0000-20-brute-force.adoc[leveloffset=+1]
 
 include::0000-21-decrease-and-conquer.adoc[leveloffset=+1]
 
-include::0000-21-divide-and-conquer.adoc[leveloffset=+1]
+include::0000-22-divide-and-conquer.adoc[leveloffset=+1]
 
-include::0000-22-transform-and-conquer.adoc[leveloffset=+1]
+include::0000-23-transform-and-conquer.adoc[leveloffset=+1]
 
-include::0000-23-backtrack.adoc[leveloffset=+1]
+include::0000-24-backtrack.adoc[leveloffset=+1]
 
 include::0000-24-subsets.adoc[leveloffset=+1]