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

@@ -25,7 +25,7 @@ void backtrack(vector<int> &choices, int state, int n, vector<int> &res) {
 
 /* 爬楼梯：回溯 */
 int climbingStairsBacktrack(int n) {
-    vector<int> choices = {1, 2}; // 可选择向上爬 1 或 2 阶
+    vector<int> choices = {1, 2}; // 可选择向上爬 1 阶或 2 阶
     int state = 0;                // 从第 0 阶开始爬
     vector<int> res = {0};        // 使用 res[0] 记录方案数量
     backtrack(choices, state, n, res);

codes/cpp/chapter_dynamic_programming/coin_change.cpp

@@ -16,7 +16,7 @@ int coinChangeDP(vector<int> &coins, int amt) {
     for (int a = 1; a <= amt; a++) {
         dp[0][a] = MAX;
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for (int i = 1; i <= n; i++) {
         for (int a = 1; a <= amt; a++) {
             if (coins[i - 1] > a) {

codes/cpp/chapter_dynamic_programming/edit_distance.cpp

@@ -65,7 +65,7 @@ int editDistanceDP(string s, string t) {
     for (int j = 1; j <= m; j++) {
         dp[0][j] = j;
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for (int i = 1; i <= n; i++) {
         for (int j = 1; j <= m; j++) {
             if (s[i - 1] == t[j - 1]) {

codes/cpp/chapter_dynamic_programming/knapsack.cpp

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

codes/cpp/chapter_dynamic_programming/min_path_sum.cpp

@@ -59,7 +59,7 @@ int minPathSumDP(vector<vector<int>> &grid) {
     for (int i = 1; i < n; i++) {
         dp[i][0] = dp[i - 1][0] + grid[i][0];
     }
-    // 状态转移：其余行列
+    // 状态转移：其余行和列
     for (int i = 1; i < n; i++) {
         for (int j = 1; j < m; j++) {
             dp[i][j] = min(dp[i][j - 1], dp[i - 1][j]) + grid[i][j];