Merge pull request greyireland#39 from chienmy/master

greyireland · web-flow · commit 8c7454533475 · 2021-03-26T19:29:00.000+08:00
Java版完成打卡
diff --git a/README.md b/README.md
@@ -102,3 +102,4 @@
 | ✅   | [dashidhy](https://github.com/dashidhy) | [algorithm-pattern-python(Python 实现)](https://github.com/dashidhy/algorithm-pattern-python) |
 | ✅   | [binzi56](https://github.com/binzi56) | [algorithm-pattern-c(c++ 实现)](https://github.com/binzi56/algorithm-pattern-c) |
 | ✅   | [lvseouren](https://github.com/lvseouren) | [algorithm-study-record(c++ 实现)](https://github.com/lvseouren/algorithm-study-record) |
+| ✅   | [chienmy](https://github.com/chienmy) | [algorithm-pattern-java(Java 实现)](https://github.com/chienmy/algorithm-pattern-java), [在线文档 Gitbook](https://chienmy.gitbook.io/algorithm-pattern-java/) |
diff --git a/basic_algorithm/sort.md b/basic_algorithm/sort.md
@@ -121,15 +121,15 @@ func sink(a []int, i int, length int) {
 	for {
 		// 左节点索引(从0开始，所以左节点为i*2+1)
 		l := i*2 + 1
-		// 有节点索引
+		// 右节点索引
 		r := i*2 + 2
 		// idx保存根、左、右三者之间较大值的索引
 		idx := i
 		// 存在左节点，左节点值较大，则取左节点
 		if l < length && a[l] > a[idx] {
 			idx = l
 		}
-		// 存在有节点，且值较大，取右节点
+		// 存在右节点，且值较大，取右节点
 		if r < length && a[r] > a[idx] {
 			idx = r
 		}
