Commit bcdf3e4

authored

Update 0347.前K个高频元素.md

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

1 parent 1c390b3 commit bcdf3e4Copy full SHA for bcdf3e4

File tree

1 file changed

-1

lines changed

problems
- 0347.前K个高频元素.md

1 file changed

-1

lines changed

`‎problems/0347.前K个高频元素.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -421,7 +421,7 @@ class Heap {`
`421`	`421`	`let left = 1; // left 是左子节点下标 left + 1 则是右子节点下标`
`422`	`422`	`let searchChild = this.compare(left, left + 1) > 0 ? left + 1 : left;`
`423`	`423`
`424`		`- while (searchChild !==undefined&&this.compare(index, searchChild) > 0) { // 注意compare参数顺序`
	`424`	`+ while (this.compare(index, searchChild) > 0) { // 注意compare参数顺序`
`425`	`425`	`[this.queue[index], this.queue[searchChild]] = [this.queue[searchChild], this.queue[index]];`
`426`	`426`
`427`	`427`	`// 更新下标`

0 commit comments

Comments

(0)

Navigation Menu

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

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit bcdf3e4

File tree

1 file changed

1 file changed

`‎problems/0347.前K个高频元素.md‎`

0 commit comments