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/python/chapter_divide_and_conquer/hanota.py

@@ -14,7 +14,7 @@ def move(src: list[int], tar: list[int]):
 
 
 def dfs(i: int, src: list[int], buf: list[int], tar: list[int]):
-    """求解汉诺塔：问题 f(i)"""
+    """求解汉诺塔问题 f(i)"""
     # 若 src 只剩下一个圆盘，则直接将其移到 tar
     if i == 1:
         move(src, tar)
@@ -28,7 +28,7 @@ def dfs(i: int, src: list[int], buf: list[int], tar: list[int]):
 
 
 def solve_hanota(A: list[int], B: list[int], C: list[int]):
-    """求解汉诺塔"""
+    """求解汉诺塔问题"""
     n = len(A)
     # 将 A 顶部 n 个圆盘借助 B 移到 C
     dfs(n, A, B, C)