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_heap/my_heap.cpp

@@ -24,7 +24,7 @@ class MaxHeap {
 
     /* 获取父节点索引 */
     int parent(int i) {
-        return (i - 1) / 2; // 向下取整
+        return (i - 1) / 2; // 向下整除
     }
 
     /* 从节点 i 开始，从底至顶堆化 */
@@ -100,7 +100,7 @@ class MaxHeap {
         if (isEmpty()) {
             throw out_of_range("堆为空");
         }
-        // 交换根节点与最右叶节点（即交换首元素与尾元素）
+        // 交换根节点与最右叶节点（交换首元素与尾元素）
         swap(maxHeap[0], maxHeap[size() - 1]);
         // 删除节点
         maxHeap.pop_back();