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

@@ -25,9 +25,9 @@ function binarySearch(nums, target) {
     return -1;
 }
 
-/* 二分查找（左闭右开） */
+/* 二分查找（左闭右开区间） */
 function binarySearchLCRO(nums, target) {
-    // 初始化左闭右开 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1
+    // 初始化左闭右开区间 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1
     let i = 0,
         j = nums.length;
     // 循环，当搜索区间为空时跳出（当 i = j 时为空）
@@ -55,6 +55,6 @@ const nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35];
 let index = binarySearch(nums, target);
 console.log('目标元素 6 的索引 = ' + index);
 
-/* 二分查找（左闭右开） */
+/* 二分查找（左闭右开区间） */
 index = binarySearchLCRO(nums, target);
 console.log('目标元素 6 的索引 = ' + index);