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

“倒叙” -> “倒序”

Browse Source
This commit is contained in:
bqlin
2021-12-19 18:58:57 +08:00
parent 6144420c39
commit 1104815b18
10 changed files with 14 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -107,7 +107,7 @@ public:
}
}
// 找出前K个高频元素，因为小顶堆先弹出的是最小的，所以倒叙来输出到数组
// 找出前K个高频元素，因为小顶堆先弹出的是最小的，所以倒序来输出到数组
vector<int> result(k);
for (int i = k - 1; i >= 0; i--) {
result[i] = pri_que.top().first;
@@ -180,7 +180,7 @@ class Solution:
if len(pri_que) > k: #如果堆的大小大于了K，则队列弹出，保证堆的大小一直为k
heapq.heappop(pri_que)
#找出前K个高频元素，因为小顶堆先弹出的是最小的，所以倒叙来输出到数组
#找出前K个高频元素，因为小顶堆先弹出的是最小的，所以倒序来输出到数组
result = [0] * k
for i in range(k-1, -1, -1):
result[i] = heapq.heappop(pri_que)[1]