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_divide_and_conquer/hanota.swift

@@ -12,7 +12,7 @@ func move(src: inout [Int], tar: inout [Int]) {
     tar.append(pan)
 }
 
-/* 求解汉诺塔：问题 f(i) */
+/* 求解汉诺塔问题 f(i) */
 func dfs(i: Int, src: inout [Int], buf: inout [Int], tar: inout [Int]) {
     // 若 src 只剩下一个圆盘，则直接将其移到 tar
     if i == 1 {
@@ -27,7 +27,7 @@ func dfs(i: Int, src: inout [Int], buf: inout [Int], tar: inout [Int]) {
     dfs(i: i - 1, src: &buf, buf: &src, tar: &tar)
 }
 
-/* 求解汉诺塔 */
+/* 求解汉诺塔问题 */
 func solveHanota(A: inout [Int], B: inout [Int], C: inout [Int]) {
     let n = A.count
     // 列表尾部是柱子顶部