피드백 반영

Author: wad-jangjaejeong

contains-duplicate/jaejeong1.java

@@ -13,4 +13,4 @@ public boolean containsDuplicate(int[] nums) {
     Set<Integer> set = Arrays.stream(nums).collect(HashSet::new, Set::add, Set::addAll);
     return set.size() != nums.length;
   }
-}
+}

kth-smallest-element-in-a-bst/jaejeong1.java

@@ -33,4 +33,4 @@ private void inorder(TreeNode root, List<Integer> list) {
     list.add(root.val);
     inorder(root.right, list);
   }
-}
+}

number-of-1-bits/jaejeong1.java

@@ -11,4 +11,4 @@ public int hammingWeight(int n) {
     }
     return num;
   }
-}
+}

palindromic-substrings/jaejeong1.java

@@ -49,4 +49,4 @@ private boolean isPalindrome(String s) {
 
     return true;
   }
-}
+}

top-k-frequent-elements/jaejeong1.java

@@ -1,4 +1,3 @@
-import java.util.Arrays;
 import java.util.HashMap;
 import java.util.Map;
 
@@ -16,12 +15,10 @@ public int[] topKFrequent(int[] nums, int k) {
     }
 
     // 빈도순 정렬
-    int[] sortedNums = freq.keySet().stream()
+    return freq.keySet().stream()
       .sorted((a, b) -> freq.get(b) - freq.get(a))
       .mapToInt(i -> i)
+      .limit(k) // 배열에서 상위 k개만 반환
       .toArray();
-
-    // 배열에서 상위 k개만 반환
-    return Arrays.copyOf(sortedNums, k);
   }
-}
+}