- 리뷰 반영

Author: geegong

contains-duplicate/Geegong.java

@@ -9,7 +9,7 @@ public class Geegong {
      * time complexity : O(n)
      * space complexity : o(n)
      * @param nums
-     * @return
+     * @return boolean
      */
     public boolean containsDuplicate(int[] nums) {
 

longest-consecutive-sequence/Geegong.java

@@ -15,7 +15,7 @@ public class Geegong {
      *    - O (N) : sorting된걸 한번 더 순회
      * Space complexity : O(N) -> hash set
      * @param nums
-     * @return
+     * @return int
      */
     public int longestConsecutive(int[] nums) {
         if (nums.length == 0) {
@@ -46,61 +46,8 @@ public int longestConsecutive(int[] nums) {
             prev = sortedNums[index];
         }
 
-
-
         return Math.max(currentLength, maxLength);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
     }
-//        HashSet<Integer> setOfNums = new HashSet<>();
-//        // key : startIndex , value : length
-//        Map<Integer, Integer> lengthMap = new HashMap<>();
-//
-//        // sort..? 를 해야될까 싶음..
-//
-//        // initialize
-//        for (int num : nums) {
-//            setOfNums.add(num);
-//        }
-//
-//        Integer longest = 0;
-//
-//        for (Integer num : setOfNums) {
-//            int length = iterate(setOfNums, num, 0, lengthMap);
-//            longest = Math.max(longest, length);
-//        }
-//
-//        return longest;
-//    }
-//
-//    public Integer iterate(HashSet<Integer> hashSet, int currIndex, int currLength, Map<Integer, Integer> lengthMap) {
-//        if (lengthMap.containsKey(currIndex)) {
-//            return lengthMap.get(currIndex);
-//        }
-//
-//        if (hashSet.contains(currIndex)) {
-//            currLength++;
-//            return iterate(hashSet, currIndex+1, currLength, lengthMap);
-//
-//        } else {
-//            lengthMap.put(currIndex, currLength);
-//            return currLength;
-//        }
-//
-//    }
 
 }
 

top-k-frequent-elements/Geegong.java

@@ -15,7 +15,7 @@ public class Geegong {
      *    - O(N) : frequency 그룹핑된 그룹 갯수만큼 iterate
      * @param nums
      * @param k
-     * @return
+     * @return int[]
      */
     public int[] topKFrequent(int[] nums, int k) {
 
@@ -56,7 +56,8 @@ public int[] topKFrequent(int[] nums, int k) {
 
         return result.stream().mapToInt(Integer::intValue).toArray();
 
-
+// 아래 문제풀이는 예전 기수에 풀었던 방법으로 Map 으로 빈도수와 num을 관리하는 값을 가지긴 하나
+// sorting은 하지 않고 maxNumOfFrequency를 구하여 순차적으로 작은 값들을 꺼내서 k만큼 리턴한다
 //        int[] result = new int[k];
 //
 //        // key : num element in nums / value : frequency of num elements

two-sum/Geegong.java

@@ -8,7 +8,7 @@ public class Geegong {
      * space complexity : O(n)
      * @param nums
      * @param target
-     * @return
+     * @return int[]
      */
     public int[] twoSum(int[] nums, int target) {
         int[] result = new int[2];
@@ -27,28 +27,6 @@ public int[] twoSum(int[] nums, int target) {
         }
 
         return result;
-
-
-//        Map<Integer, Integer> map = new HashMap<>();
-//        int[] result = new int[2];
-//
-//        // if target = -9 / num = 1 , num = -10
-//        for (int index=0; index<nums.length; index++) {
-//            map.put(nums[index], index);
-//        }
-//
-//        for (int index=0; index<nums.length; index++) {
-//            int difference = target - nums[index];
-//
-//            if (map.containsKey(difference)
-//                    && map.get(difference) != index) {
-//                result[0] = index;
-//                result[1] = map.get(difference);
-//                return result;
-//            }
-//        }
-//
-//        return result;
     }
 }