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/swift/chapter_dynamic_programming/climbing_stairs_backtrack.swift

@@ -22,7 +22,7 @@ func backtrack(choices: [Int], state: Int, n: Int, res: inout [Int]) {
 
 /* 爬楼梯：回溯 */
 func climbingStairsBacktrack(n: Int) -> Int {
-    let choices = [1, 2] // 可选择向上爬 1 或 2 阶
+    let choices = [1, 2] // 可选择向上爬 1 阶或 2 阶
     let state = 0 // 从第 0 阶开始爬
     var res: [Int] = []
     res.append(0) // 使用 res[0] 记录方案数量

codes/swift/chapter_dynamic_programming/coin_change.swift

@@ -14,7 +14,7 @@ func coinChangeDP(coins: [Int], amt: Int) -> Int {
     for a in stride(from: 1, through: amt, by: 1) {
         dp[0][a] = MAX
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for i in stride(from: 1, through: n, by: 1) {
         for a in stride(from: 1, through: amt, by: 1) {
             if coins[i - 1] > a {

codes/swift/chapter_dynamic_programming/edit_distance.swift

@@ -73,7 +73,7 @@ func editDistanceDP(s: String, t: String) -> Int {
     for j in stride(from: 1, through: m, by: 1) {
         dp[0][j] = j
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for i in stride(from: 1, through: n, by: 1) {
         for j in stride(from: 1, through: m, by: 1) {
             if s.utf8CString[i - 1] == t.utf8CString[j - 1] {

codes/swift/chapter_dynamic_programming/knapsack.swift

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

codes/swift/chapter_dynamic_programming/min_path_sum.swift

@@ -58,7 +58,7 @@ func minPathSumDP(grid: [[Int]]) -> Int {
     for i in stride(from: 1, to: n, by: 1) {
         dp[i][0] = dp[i - 1][0] + grid[i][0]
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for i in stride(from: 1, to: n, by: 1) {
         for j in stride(from: 1, to: m, by: 1) {
             dp[i][j] = min(dp[i][j - 1], dp[i - 1][j]) + grid[i][j]