hongseoupyun_two_sum_solution

Author: hongseoupyun

two-sum/hongseoupyun.py

@@ -0,0 +1,9 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        seen = {}
+        for i, num in enumerate(nums):
+            complement = target - num
+            if complement in seen:      
+                return [seen[complement], i]
+            seen[num] = i               
+        return []