algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 0347.前K个高频元素：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-01 12:57:24 +08:00
committed by GitHub
parent 1662ac347d
commit b28ba70ee1
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0347.前K个高频元素.md
View File

@ -79,8 +79,6 @@
```CPP
// 时间复杂度：O(nlogk)
// 空间复杂度：O(n)
class Solution {
public:
// 小顶堆
@ -120,6 +118,10 @@ public:
}
};
```
* 时间复杂度: O(nlogk)
* 空间复杂度: O(n)
# 拓展
大家对这个比较运算在建堆时是如何应用的，为什么左大于右就会建立小顶堆，反而建立大顶堆比较困惑。