파일의 마지막에 개행문자를 추가

Author: dohyeon2

house-robber/dohyeon2.java

@@ -27,4 +27,4 @@ public int rob(int[] nums) {
 
         return dp[nums.length - 1];
     }
-}
+}

longest-consecutive-sequence/dohyeon2.java

@@ -76,4 +76,4 @@ public int longestConsecutive(int[] nums) {
 
         return count;
     }
-}
+}

top-k-frequent-elements/dohyeon2.java

@@ -44,4 +44,4 @@ public int[] topKFrequent(int[] nums, int k) {
 
         return result;
     }
-}
+}

two-sum/dohyeon2.java

@@ -2,29 +2,30 @@
 
 class Solution {
     public int[] twoSum(int[] nums, int target) {
-        // Approach : using HashMap to get index with the element in O(n) time complexity
+        // Approach : using HashMap to get index with the element in O(n) time
+        // complexity
         // SpaceComplexity is also O(n)
-        HashMap<Integer,Integer> numIndexMap = new HashMap<Integer,Integer>();
+        HashMap<Integer, Integer> numIndexMap = new HashMap<Integer, Integer>();
 
         // Make key and value HashMap
-        for(int i = 0; i < nums.length; i++){
+        for (int i = 0; i < nums.length; i++) {
             int num = nums[i];
-            numIndexMap.put(num,i);
+            numIndexMap.put(num, i);
         }
 
         // Search for the other operand looping nums
-        for(int i = 0; i < nums.length; i++){
+        for (int i = 0; i < nums.length; i++) {
             int num = nums[i];
             int operand = target - num;
             Integer index = numIndexMap.get(operand);
             boolean indexExists = index != null;
             boolean indexExistsAndIndexIsNotTheNum = indexExists && i != index;
-            if(indexExistsAndIndexIsNotTheNum){
+            if (indexExistsAndIndexIsNotTheNum) {
                 // Manual sort
-                if( i < index){
-                    return new int[]{ i, index };
-                }else{
-                    return new int[]{ index, i };
+                if (i < index) {
+                    return new int[] { i, index };
+                } else {
+                    return new int[] { index, i };
                 }
             }
         }
@@ -33,4 +34,4 @@ public int[] twoSum(int[] nums, int target) {
         // But the compiler don't know about that
         return new int[2];
     }
-}
+}