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

@@ -20,7 +20,7 @@ void move(int *src, int *srcSize, int *tar, int *tarSize) {
     (*tarSize)++;
 }
 
-/* 求解汉诺塔：问题 f(i) */
+/* 求解汉诺塔问题 f(i) */
 void dfs(int i, int *src, int *srcSize, int *buf, int *bufSize, int *tar, int *tarSize) {
     // 若 src 只剩下一个圆盘，则直接将其移到 tar
     if (i == 1) {
@@ -35,7 +35,7 @@ void dfs(int i, int *src, int *srcSize, int *buf, int *bufSize, int *tar, int *t
     dfs(i - 1, buf, bufSize, src, srcSize, tar, tarSize);
 }
 
-/* 求解汉诺塔 */
+/* 求解汉诺塔问题 */
 void solveHanota(int *A, int *ASize, int *B, int *BSize, int *C, int *CSize) {
     // 将 A 顶部 n 个圆盘借助 B 移到 C
     dfs(*ASize, A, ASize, B, BSize, C, CSize);