feat: Revised the book (#978)

* Sync recent changes to the revised Word.

* Revised the preface chapter

* Revised the introduction chapter

* Revised the computation complexity chapter

* Revised the chapter data structure

* Revised the chapter array and linked list

* Revised the chapter stack and queue

* Revised the chapter hashing

* Revised the chapter tree

* Revised the chapter heap

* Revised the chapter graph

* Revised the chapter searching

* Reivised the sorting chapter

* Revised the divide and conquer chapter

* Revised the chapter backtacking

* Revised the DP chapter

* Revised the greedy chapter

* Revised the appendix chapter

* Revised the preface chapter doubly

* Revised the figures

codes/zig/chapter_dynamic_programming/climbing_stairs_backtrack.zig

@@ -24,7 +24,7 @@ fn backtrack(choices: []i32, state: i32, n: i32, res: std.ArrayList(i32)) void {
 
 // 爬楼梯：回溯
 fn climbingStairsBacktrack(n: usize) !i32 {
-    var choices = [_]i32{ 1, 2 }; // 可选择向上爬 1 或 2 阶
+    var choices = [_]i32{ 1, 2 }; // 可选择向上爬 1 阶或 2 阶
     var state: i32 = 0; // 从第 0 阶开始爬
     var res = std.ArrayList(i32).init(std.heap.page_allocator);
     defer res.deinit();