top frequent elements solved

Author: mintheon

top-k-frequent-elements/mintheon.java

@@ -1,24 +1,24 @@
-import java.util.HashMap;
-import java.util.Map;
-import java.util.Map.Entry;
-import java.util.PriorityQueue;
-
 class Solution {
   public int[] topKFrequent(int[] nums, int k) {
     int[] answer = new int[k];
-    Map<Integer, Integer> frequent = new HashMap<>();
+    Map<Integer, Integer> count = new HashMap<>();
 
-    for(int num: nums) {
-      frequent.put(num, frequent.getOrDefault(num, 1) + 1);
+    for(int i = 0; i < nums.length; i++) {
+      count.put(nums[i], count.getOrDefault(nums[i], 0) + 1);
     }
 
-    PriorityQueue<Entry<Integer, Integer>> pq = new PriorityQueue<>((a, b) -> b.getValue().compareTo(a.getValue()));
-    pq.addAll(frequent.entrySet());
+    PriorityQueue<int[]> queue = new PriorityQueue<>((a, b) -> b[1] - a[1]);
+
+    for(int key : count.keySet()) {
+      queue.offer(new int[]{key, count.get(key)});
+    }
 
     for(int i = 0; i < k; i++) {
-      answer[i] = pq.poll().getKey();
+      int[] num = queue.poll();
+
+      answer[i] = num[0];
     }
 
     return answer;
   }
-}
+}