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/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 {