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();

codes/zig/chapter_dynamic_programming/coin_change.zig

@@ -14,7 +14,7 @@ fn coinChangeDP(comptime coins: []i32, comptime amt: usize) i32 {
     for (1..amt + 1) |a| {
         dp[0][a] = max;
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for (1..n + 1) |i| {
         for (1..amt + 1) |a| {
             if (coins[i - 1] > @as(i32, @intCast(a))) {

codes/zig/chapter_dynamic_programming/edit_distance.zig

@@ -73,7 +73,7 @@ fn editDistanceDP(comptime s: []const u8, comptime t: []const u8) i32 {
     for (1..m + 1) |j| {
         dp[0][j] = @intCast(j);
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for (1..n + 1) |i| {
         for (1..m + 1) |j| {
             if (s[i - 1] == t[j - 1]) {

codes/zig/chapter_dynamic_programming/knapsack.zig

@@ -6,11 +6,11 @@ const std = @import("std");
 
 // 0-1 背包：暴力搜索
 fn knapsackDFS(wgt: []i32, val: []i32, i: usize, c: usize) i32 {
-    // 若已选完所有物品或背包无容量，则返回价值 0
+    // 若已选完所有物品或背包无剩余容量，则返回价值 0
     if (i == 0 or c == 0) {
         return 0;
     }
-    // 若超过背包容量，则只能不放入背包
+    // 若超过背包容量，则只能选择不放入背包
     if (wgt[i - 1] > c) {
         return knapsackDFS(wgt, val, i - 1, c);
     }
@@ -23,7 +23,7 @@ fn knapsackDFS(wgt: []i32, val: []i32, i: usize, c: usize) i32 {
 
 // 0-1 背包：记忆化搜索
 fn knapsackDFSMem(wgt: []i32, val: []i32, mem: anytype, i: usize, c: usize) i32 {
-    // 若已选完所有物品或背包无容量，则返回价值 0
+    // 若已选完所有物品或背包无剩余容量，则返回价值 0
     if (i == 0 or c == 0) {
         return 0;
     }
@@ -31,7 +31,7 @@ fn knapsackDFSMem(wgt: []i32, val: []i32, mem: anytype, i: usize, c: usize) i32
     if (mem[i][c] != -1) {
         return mem[i][c];
     }
-    // 若超过背包容量，则只能不放入背包
+    // 若超过背包容量，则只能选择不放入背包
     if (wgt[i - 1] > c) {
         return knapsackDFSMem(wgt, val, mem, i - 1, c);
     }

codes/zig/chapter_dynamic_programming/min_path_sum.zig

@@ -59,7 +59,7 @@ fn minPathSumDP(comptime grid: anytype) i32 {
     for (1..n) |i| {
         dp[i][0] = dp[i - 1][0] + grid[i][0];
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for (1..n) |i| {
         for (1..m) |j| {
             dp[i][j] = @min(dp[i][j - 1], dp[i - 1][j]) + grid[i][j];