[pull] master from youngyangyang04:master #452

1. 修复了 JavaScript 解法二,堆 pop 方法无法处理数组长度 <= 1 的边界情况的问题
2. 删除了有误导性的条件判断。事实上,被删除的表达式永远为真(searchChild !== undefined)。原作者想表达的意思可能是 this.queue[searchChild] !== undefined,而实际上,这个判断也是不必要的,这种情况会被后续的 this.compare(index, searchChild) > 0 判断排除。但鉴于本项目的教程性质,直接去除可能会导致语义不清,考虑酌情将原处替换为 this.queue[searchChild] !== undefined 或直接删除

Loading branch information

@xqsrpanz

xqsrpanz authored Apr 26, 2024

commit bcdf3e4ecdf352ee5f6a9d539bd980c66c3ea93e

2 changes: 1 addition & 1 deletion problems/0347.前K个高频元素.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -421,7 +421,7 @@ class Heap {
		let left = 1; // left 是左子节点下标 left + 1 则是右子节点下标
		let searchChild = this.compare(left, left + 1) > 0 ? left + 1 : left;

	while (searchChild !== undefined && this.compare(index, searchChild) > 0) { // 注意compare参数顺序
	while (this.compare(index, searchChild) > 0) { // 注意compare参数顺序
		[this.queue[index], this.queue[searchChild]] = [this.queue[searchChild], this.queue[index]];

		// 更新下标
Expand Down

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

[pull] master from youngyangyang04:master #452

Uh oh!

[pull] master from youngyangyang04:master #452

Filter by extension

Uh oh!

Uh oh!

Diff view

Diff view

Uh oh!

There are no files selected for viewing