github/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Several bug fixes.

Browse Source
This commit is contained in:
krahets 2023-09-20 01:53:44 +08:00
parent 53d91db10d
commit 8effa58a59
7 changed files with 6 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
codes/cpp/chapter_heap/my_heap.cpp
View File

@ -47,7 +47,6 @@ class MaxHeap {
while (true) { while (true) {
// 判断节点 i, l, r 中值最大的节点，记为 ma // 判断节点 i, l, r 中值最大的节点，记为 ma
int l = left(i), r = right(i), ma = i; int l = left(i), r = right(i), ma = i;
// 若节点 i 最大或索引 l, r 越界，则无须继续堆化，跳出
if (l < size() && maxHeap[l] > maxHeap[ma]) if (l < size() && maxHeap[l] > maxHeap[ma])
ma = l; ma = l;
if (r < size() && maxHeap[r] > maxHeap[ma]) if (r < size() && maxHeap[r] > maxHeap[ma])

1
codes/javascript/chapter_hashing/array_hash_map.js
View File

@ -83,7 +83,6 @@ class ArrayHashMap {
print() { print() {
let pairSet = this.entries(); let pairSet = this.entries();
for (const pair of pairSet) { for (const pair of pairSet) {
if (!pair) continue;
console.info(`${pair.key} -> ${pair.val}`); console.info(`${pair.key} -> ${pair.val}`);
} }
} }

1
codes/typescript/chapter_hashing/array_hash_map.ts
View File

@ -87,7 +87,6 @@ class ArrayHashMap {
public print() { public print() {
let pairSet = this.entries(); let pairSet = this.entries();
for (const pair of pairSet) { for (const pair of pairSet) {
if (!pair) continue;
console.info(`${pair.key} -> ${pair.val}`); console.info(`${pair.key} -> ${pair.val}`);
} }
} }