[shinheekim] WEEK 01 solutions

contains-duplicate/shinheekim.java

@@ -0,0 +1,15 @@
+import java.util.HashSet;
+import java.util.Set;
+
+class Solution {
+    public boolean containsDuplicate(int[] nums) {
+        Set<Integer> visited = new HashSet<>();
+
+        for (int n : nums){
+            if (!visited.add(n)){
+                return true;
+            }
+        }
+        return false; // 모든 값이 고유할 때
+    }
+}

two-sum/shinheekim.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        int[] result = new int[2];
+
+        for (int i = 0; i < nums.length; i++){
+            for (int j = i + 1; j < nums.length; j++){
+                if (nums[i] + nums[j] == target){
+                    result[0] = i;
+                    result[1] = j;
+                    return result;
+                }
+            }
+        }
+        return null;
+    }
+}