👔 top-k-frequent-elements solution

Author: dohee789

top-k-frequent-elements/dohee789.java

@@ -0,0 +1,31 @@
+/*
+https://leetcode.com/problems/top-k-frequent-elements/
+ */
+class Solution {
+    public int[] topKFrequent(int[] nums, int k) {
+        Map<Integer, Integer> freqMap = new HashMap<>();
+        for(int num: nums){
+            freqMap.put(num, freqMap.getOrDefault(num,0)+1);
+        }
+
+        PriorityQueue<Map.Entry<Integer, Integer>> minHeap = new PriorityQueue<>(
+                Comparator.comparingInt(Map.Entry::getValue)
+        );
+
+        for (Map.Entry<Integer, Integer> entry : freqMap.entrySet()) {
+            minHeap.offer(entry);
+            if (minHeap.size() > k) {
+                minHeap.poll();
+            }
+        }
+
+        int[] result = new int[k];
+        for (int i = 0; i < k; i++) {
+            result[i] = minHeap.poll().getKey();
+        }
+
+        return result;
+
+    }
+}
+