fix: lint

Author: Yongseok-Choi-dev

contains-duplicate/YoungSeok-Choi.java

@@ -1,3 +1,6 @@
+import java.util.HashMap;
+import java.util.Map;
+
 class Solution {
     // 시간복잡도 O(n)
     public boolean containsDuplicate(int[] nums) {
@@ -13,4 +16,4 @@ public boolean containsDuplicate(int[] nums) {
 
         return false;
     }
-}
+}

house-robber/YoungSeok-Choi.java

@@ -81,4 +81,4 @@ public void dfs(int[] arr, int idx) {
         visit[idx] = false;
         curSum -= arr[idx];
     }
-}
+}

longest-consecutive-sequence/YoungSeok-Choi.java

@@ -1,5 +1,4 @@
 import java.util.Arrays;
-import java.util.*;
 
 class Solution {
     public int longestConsecutive(int[] nums) {
@@ -32,4 +31,4 @@ public int longestConsecutive(int[] nums) {
 
         return Math.max(maxSeq, curSeq);
     }
-}
+}

product-of-array-except-self/YoungSeok-Choi.java

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

two-sum/YoungSeok-Choi.java

@@ -1,6 +1,9 @@
 // time complexity: O(n);
-
 // 특정 nums[i] 가 target이 되기위한 보수 (target - nums[i])를 candidate Map에서 찾으면 종료
+
+import java.util.HashMap;
+import java.util.Map;
+
 class Solution {
     public int[] twoSum(int[] nums, int target) {
         Map<Integer, Integer> candidate = new HashMap<>();
@@ -17,4 +20,4 @@ public int[] twoSum(int[] nums, int target) {
         }
         return new int[0];
     }
-}
+}