xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-23 16:47:13 +00:00
Code Issues Packages Projects Releases Wiki Activity

Polish the chapter

Browse Source 
introduction, computational complexity.
This commit is contained in:
krahets
2023-08-20 14:51:39 +08:00
parent 5fb728b3d6
commit 2626de8d0b
87 changed files with 375 additions and 371 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/dart/chapter_heap/my_heap.dart
+2 -2
View File
@@ -70,7 +70,7 @@ class MaxHeap {
while (true) {
// 获取节点 i 的父节点
int p = _parent(i);
// 当“越过根节点”或“节点无需修复”时，结束堆化
// 当“越过根节点”或“节点无须修复”时，结束堆化
if (p < 0 || _maxHeap[i] <= _maxHeap[p]) {
break;
}
@@ -104,7 +104,7 @@ class MaxHeap {
int ma = i;
if (l < size() && _maxHeap[l] > _maxHeap[ma]) ma = l;
if (r < size() && _maxHeap[r] > _maxHeap[ma]) ma = r;
// 若节点 i 最大或索引 l, r 越界，则无需继续堆化，跳出
// 若节点 i 最大或索引 l, r 越界，则无须继续堆化，跳出
if (ma == i) break;
// 交换两节点
_swap(i, ma);
codes/dart/chapter_heap/top_k.dart
+2 -2
View File
@@ -100,7 +100,7 @@ class MinHeap {
while (true) {
// 获取节点 i 的父节点
int p = _parent(i);
// 当“越过根节点”或“节点无需修复”时，结束堆化
// 当“越过根节点”或“节点无须修复”时，结束堆化
if (p < 0 || _minHeap[i] >= _minHeap[p]) {
break;
}
@@ -134,7 +134,7 @@ class MinHeap {
int mi = i;
if (l < size() && _minHeap[l] < _minHeap[mi]) mi = l;
if (r < size() && _minHeap[r] < _minHeap[mi]) mi = r;
// 若节点 i 最大或索引 l, r 越界，则无需继续堆化，跳出
// 若节点 i 最大或索引 l, r 越界，则无须继续堆化，跳出
if (mi == i) break;
// 交换两节点
_swap(i, mi);