Skip to content

[pull] master from youngyangyang04:master #452

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged

pull merged 3 commits into AlgorithmAndLeetCode:master from youngyangyang04:master

May 22, 2024

Merged

[pull] master from youngyangyang04:master #452

Changes from all commits

Commits

Show all changes

Select commit Hold shift + click to select a range

修复了 JavaScript 解法二,堆 pop 方法无法处理数组长度 <= 1 的边界情况的问题

xqsrpanz Apr 26, 2024

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

xqsrpanz Apr 26, 2024

Merge pull request #2542 from xqsrpanz/master

youngyangyang04 May 22, 2024

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

8 changes: 7 additions & 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		@@ -405,6 +405,11 @@ class Heap {

		// 获取堆顶元素并移除
		pop() {
	// 边界情况,只有一个元素或没有元素应直接弹出
	if (this.size() <= 1) {
	return this.queue.pop()
	}

		// 堆顶元素
		const out = this.queue[0];

Expand All		@@ -416,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 Expand Up		@@ -608,3 +613,4 @@ impl Solution {
		<a href="https://programmercarl.com/other/kstar.html" target="_blank">
		<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
		</a>