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

@@ -28,7 +28,7 @@ int binarySearch(List<int> nums, int target) {
 
 /* 二分查找（左闭右开区间） */
 int binarySearchLCRO(List<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) {

codes/dart/chapter_searching/two_sum.dart

@@ -9,7 +9,7 @@ import 'dart:collection';
 /* 方法一： 暴力枚举 */
 List<int> twoSumBruteForce(List<int> nums, int target) {
   int size = nums.length;
-  // 两层循环，时间复杂度 O(n^2)
+  // 两层循环，时间复杂度为 O(n^2)
   for (var i = 0; i < size - 1; i++) {
     for (var j = i + 1; j < size; j++) {
       if (nums[i] + nums[j] == target) return [i, j];
@@ -21,9 +21,9 @@ List<int> twoSumBruteForce(List<int> nums, int target) {
 /* 方法二： 辅助哈希表 */
 List<int> twoSumHashTable(List<int> nums, int target) {
   int size = nums.length;
-  // 辅助哈希表，空间复杂度 O(n)
+  // 辅助哈希表，空间复杂度为 O(n)
   Map<int, int> dic = HashMap();
-  // 单层循环，时间复杂度 O(n)
+  // 单层循环，时间复杂度为 O(n)
   for (var i = 0; i < size; i++) {
     if (dic.containsKey(target - nums[i])) {
       return [dic[target - nums[i]]!, i];