From f5f62043c5a17b49970981e9b97f05b9d694d47a Mon Sep 17 00:00:00 2001
From: Jayden12138 <18993882884@163.com>
Date: Wed, 24 Apr 2024 16:35:11 +0800
Subject: [PATCH] fix(javascript): top-k-frequent-elements

---
 .../solution_code.md"                                 | 11 +++++++----
 1 file changed, 7 insertions(+), 4 deletions(-)

diff --git "a/\345\244\232\350\257\255\350\250\200\350\247\243\346\263\225\344\273\243\347\240\201/solution_code.md" "b/\345\244\232\350\257\255\350\250\200\350\247\243\346\263\225\344\273\243\347\240\201/solution_code.md"
index 4a577d5958..18055d3d88 100644
--- "a/\345\244\232\350\257\255\350\250\200\350\247\243\346\263\225\344\273\243\347\240\201/solution_code.md"
+++ "b/\345\244\232\350\257\255\350\250\200\350\247\243\346\263\225\344\273\243\347\240\201/solution_code.md"
@@ -63975,18 +63975,21 @@ var topKFrequent = function(nums, k) {
         valToFreq.set(v, valToFreq.get(v) ? valToFreq.get(v) + 1: 1);
     }
 
-    const pq = new PriorityQueue((a, b) => a.value < b.value);
+    // 最小堆    
+    const pq = new PriorityQueue({
+        compare: (a, b) => a.value - b.value
+    });
 
     for (let [key, value] of valToFreq) {
-        pq.offer({key, value});
+        pq.enqueue({key, value});
         if (pq.size() > k) {
-            pq.poll();
+            pq.dequeue();
         }
     }
 
     const res = [];
     for (let i = 0; i < k; i++) {
-        res.push(pq.poll().key);
+        res.push(pq.dequeue().key);
     }
     return res;
 };