Merge pull request #1697 from JEONGBEOMKO/main

[JEONGBEOMKO] WEEK 01 solutions

Author: JEONGBEOMKO

contains-duplicate/jeongbeomko.java

@@ -1,5 +1,9 @@
 import java.util.HashSet;
 
+/*
+* 시간복잡도: O(n)
+* 공간복잡도: O(n)
+* */
 class Solution {
     public boolean containsDuplicate(int[] nums) {
         HashSet<Integer> numSet  = new HashSet<>();

two-sum/JEONGBEOMKO.java

@@ -1,5 +1,9 @@
 import java.util.HashMap;
 import java.util.Map;
+/*
+시간복잡도: O(n)
+공간복잡도: O(n)
+ */
 
 class Solution {
     public int[] twoSum(int[] nums, int target) {
@@ -10,7 +14,7 @@ public int[] twoSum(int[] nums, int target) {
 
         for(int i=0; i<nums.length; i++) {
             int operand = target - nums[i];
-            if (numberMap.containsKey(operand) && numberMap.get(operand) != i) { // 자기 자신은 제외
+            if (numberMap.containsKey(operand) && numberMap.get(operand) != i) {
                 return new int[] { numberMap.get(target - nums[i]), i };
             }
         }