Check filename rules 해결 시도

Author: kdh-92

longest-consecutive-sequence/kdh-92.java

@@ -39,16 +39,16 @@ public int longestConsecutive(int[] nums) {
         }
 
         for(int key : hm.keySet()){
-            if(hm.containsKey(key - 1)== false){
+            if(hm.containsKey(key - 1)){
                 hm.put(key, true);
             }
         }
 
         int max = 0;
         for(int key : hm.keySet()){
             int k =1;
-            if(hm.get(key) == true){
-                while(hm.containsKey(key + k) == true){
+            if(hm.get(key)){
+                while(hm.containsKey(key + k)){
                     k++;
                 }
             }

top-k-frequent-elements/kdh-92.java

@@ -43,40 +43,40 @@ public int[] topKFrequent(int[] nums, int k) {
         // Runtime : 19ms Beats 8.16%
         // Memory : 49.00MB Beats 20.01%
         // Stream에 익숙해지기 위해 공부용
-         return Arrays.stream(nums)
-             .boxed()
-             .collect(Collectors.groupingBy(num -> num, Collectors.summingInt(num -> 1)))
-             .entrySet().stream()
-             .sorted((a, b) -> b.getValue() - a.getValue())
-             .limit(k)
-             .mapToInt(Map.Entry::getKey)
-             .toArray();
+        return Arrays.stream(nums)
+                .boxed()
+                .collect(Collectors.groupingBy(num -> num, Collectors.summingInt(num -> 1)))
+                .entrySet().stream()
+                .sorted((a, b) -> b.getValue() - a.getValue())
+                .limit(k)
+                .mapToInt(Map.Entry::getKey)
+                .toArray();
 
         // (3) Array List
         // 시간복잡도 : O(N)
         // Runtime : 13ms Beats 75.77%
         // Memory : 48.44MB Beats 61.68%
-         Map<Integer, Integer> frequencyMap = new HashMap<>();
-         for (int num : nums) {
-             frequencyMap.put(num, frequencyMap.getOrDefault(num, 0) + 1);
-         }
+        Map<Integer, Integer> frequencyMap = new HashMap<>();
+        for (int num : nums) {
+            frequencyMap.put(num, frequencyMap.getOrDefault(num, 0) + 1);
+        }
 
-         List<Integer>[] buckets = new List[nums.length + 1];
-         for (int key : frequencyMap.keySet()) {
-             int freq = frequencyMap.get(key);
-             if (buckets[freq] == null) {
-                 buckets[freq] = new ArrayList<>();
-             }
-             buckets[freq].add(key);
-         }
+        List<Integer>[] buckets = new List[nums.length + 1];
+        for (int key : frequencyMap.keySet()) {
+            int freq = frequencyMap.get(key);
+            if (buckets[freq] == null) {
+                buckets[freq] = new ArrayList<>();
+            }
+            buckets[freq].add(key);
+        }
 
-         List<Integer> result = new ArrayList<>();
-         for (int i = buckets.length - 1; i >= 0 && result.size() < k; i--) {
-             if (buckets[i] != null) {
-                 result.addAll(buckets[i]);
-             }
-         }
+        List<Integer> result = new ArrayList<>();
+        for (int i = buckets.length - 1; i >= 0 && result.size() < k; i--) {
+            if (buckets[i] != null) {
+                result.addAll(buckets[i]);
+            }
+        }
 
-         return result.stream().mapToInt(Integer::intValue).toArray();
+        return result.stream().mapToInt(Integer::intValue).toArray();
     }
-}
+}