We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 4f44711 commit 7f32fa8Copy full SHA for 7f32fa8
多语言解法代码/solution_code.md
@@ -63975,18 +63975,21 @@ var topKFrequent = function(nums, k) {
63975
valToFreq.set(v, valToFreq.get(v) ? valToFreq.get(v) + 1: 1);
63976
}
63977
63978
- const pq = new PriorityQueue((a, b) => a.value < b.value);
+ // 最小堆
63979
+ const pq = new PriorityQueue({
63980
+ compare: (a, b) => a.value - b.value
63981
+ });
63982
63983
for (let [key, value] of valToFreq) {
- pq.offer({key, value});
63984
+ pq.enqueue({key, value});
63985
if (pq.size() > k) {
- pq.poll();
63986
+ pq.dequeue();
63987
63988
63989
63990
const res = [];
63991
for (let i = 0; i < k; i++) {
- res.push(pq.poll().key);
63992
+ res.push(pq.dequeue().key);
63993
63994
return res;
63995
};
0 commit comments