🐛 top-k-frequent-elements Solution

Author: lwy-0418

top-k-frequent-elements/dalpang81.java

@@ -0,0 +1,30 @@
+import java.util.*;
+class Solution {
+    public int[] topKFrequent(int[] nums, int k) {
+        Map<Integer, Integer> map = new HashMap<>();
+
+
+        for(int i : nums) {
+            map.put(i, map.getOrDefault(i,0) + 1);
+        }
+
+        PriorityQueue<Map.Entry<Integer, Integer>> pq =
+                new PriorityQueue<>(Comparator.comparingInt(Map.Entry::getValue));
+
+        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+            pq.offer(entry);
+            if (pq.size() > k) {
+                pq.poll(); // Remove the least frequent element
+            }
+        }
+
+        // Step 3: Extract the elements from the heap
+        int[] result = new int[k];
+        for (int i = k - 1; i >= 0; i--) {
+            result[i] = pq.poll().getKey();
+        }
+
+        return result;
+
+    }
+}