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/go/chapter_graph/graph_adjacency_list.go

@@ -14,7 +14,7 @@ import (
 
 /* 基于邻接表实现的无向图类 */
 type graphAdjList struct {
-	// 邻接表，key: 顶点，value：该顶点的所有邻接顶点
+	// 邻接表，key：顶点，value：该顶点的所有邻接顶点
 	adjList map[Vertex][]Vertex
 }
 

codes/go/chapter_graph/graph_adjacency_matrix.go

@@ -76,7 +76,7 @@ func (g *graphAdjMat) addEdge(i, j int) {
 	if i < 0 || j < 0 || i >= g.size() || j >= g.size() || i == j {
 		fmt.Errorf("%s", "Index Out Of Bounds Exception")
 	}
-	// 在无向图中，邻接矩阵沿主对角线对称，即满足 (i, j) == (j, i)
+	// 在无向图中，邻接矩阵关于主对角线对称，即满足 (i, j) == (j, i)
 	g.adjMat[i][j] = 1
 	g.adjMat[j][i] = 1
 }