WEEK 1 Solutions

Author: juhui-jeong

top-k-frequent-elements/juhui-jeong.java

@@ -0,0 +1,24 @@
+class Solution {
+    public int[] topKFrequent(int[] nums, int k) {
+        Map<Integer, Integer> map = new HashMap<>();
+
+        for (int i = 0; i< nums.length; i++) {
+            if (map.containsKey(nums[i])) {
+                map.put(nums[i], map.get(nums[i])+1);
+            } else {
+                map.put(nums[i], 1);
+            }
+        }
+        
+        List<Map.Entry<Integer, Integer>> entryList = new LinkedList<>(map.entrySet());
+        entryList.sort(Map.Entry.comparingByValue(Collections.reverseOrder()));
+
+        int[] result = new int[k];
+
+        for(int i =0; i < k; i++) {
+            result[i] = entryList.get(i).getKey();
+        }
+
+        return result;
+    }
+}