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/java/chapter_searching/binary_search.java

@@ -25,9 +25,9 @@ public class binary_search {
         return -1;
     }
 
-    /* 二分查找（左闭右开） */
+    /* 二分查找（左闭右开区间） */
     static int binarySearchLCRO(int[] nums, int target) {
-        // 初始化左闭右开 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1
+        // 初始化左闭右开区间 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1
         int i = 0, j = nums.length;
         // 循环，当搜索区间为空时跳出（当 i = j 时为空）
         while (i < j) {
@@ -51,7 +51,7 @@ public class binary_search {
         int index = binarySearch(nums, target);
         System.out.println("目标元素 6 的索引 = " + index);
 
-        /* 二分查找（左闭右开） */
+        /* 二分查找（左闭右开区间） */
         index = binarySearchLCRO(nums, target);
         System.out.println("目标元素 6 的索引 = " + index);
     }