solve top k frequent elements problem

Author: sora0319

top-k-frequent-elements/sora0319.java

@@ -1,5 +1,29 @@
 import java.util.*;
+// 다른 방안
+class Solution {
+    public int[] topKFrequent(int[] nums, int k) {
+        Map <Integer,Integer> counting = new HashMap<>();
+
+        for(int n : nums){
+            if(!counting.containsKey(n)){
+                counting.put(n,0);
+            }
+            counting.put(n, counting.get(n)+1);
+        }
+
+        List<Map.Entry<Integer,Integer>>countList = new LinkedList<>(counting.entrySet());
+        countList.sort(Map.Entry.comparingByValue(Comparator.reverseOrder()));
+        
+        int[] answer = countList.stream()
+        .limit(k)
+        .mapToInt(Map.Entry::getKey)
+        .toArray();
+        return answer;
+    }
+}
+
 
+// 초안
 class Solution {
     public int[] topKFrequent(int[] nums, int k) {
         Map<Integer,Integer> counts = new HashMap<>();