fix: two sum, remove map.get(pair) condition

YuuuuuuYu · YuuuuuuYu · commit 95e992ae8972 · 2025-11-14T15:58:08.000+09:00
diff --git a/two-sum/YuuuuuuYu.java b/two-sum/YuuuuuuYu.java
@@ -1,8 +1,8 @@
 /**
- * Runtime: 3ms
+ * Runtime: 2ms
  * Time Complexity: O(n)
  *
- * Memory: 46.97MB
+ * Memory: 47.41MB
  * Space Complexity: O(n)
  *
  * Approach: HashMap을 사용하여 짝을 이루는 값(pair) 검사
@@ -14,7 +14,7 @@ public int[] twoSum(int[] nums, int target) {
         Map <Integer, Integer> map = new HashMap<>();
         for (int i=0; i<nums.length; i++) {
             int pair = target-nums[i];
-            if (map.containsKey(pair) && map.get(pair) != i) {
+            if (map.containsKey(pair)) {
                 return new int[]{i, map.get(pair)};
             }
             map.put(nums[i], i);

Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,8 @@`
`1`	`1`	`/**`
`2`		`- * Runtime: 3ms`
	`2`	`+ * Runtime: 2ms`
`3`	`3`	`* Time Complexity: O(n)`
`4`	`4`	`*`
`5`		`- * Memory: 46.97MB`
	`5`	`+ * Memory: 47.41MB`
`6`	`6`	`* Space Complexity: O(n)`
`7`	`7`	`*`
`8`	`8`	`* Approach: HashMap을 사용하여 짝을 이루는 값(pair) 검사`
`@@ -14,7 +14,7 @@ public int[] twoSum(int[] nums, int target) {`
`14`	`14`	`Map <Integer, Integer> map = new HashMap<>();`
`15`	`15`	`for (int i=0; i<nums.length; i++) {`
`16`	`16`	`int pair = target-nums[i];`
`17`		`- if (map.containsKey(pair) && map.get(pair) != i) {`
	`17`	`+ if (map.containsKey(pair)) {`
`18`	`18`	`return new int[]{i, map.get(pair)};`
`19`	`19`	`}`
`20`	`20`	`map.put(nums[i], i);`