We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0fc7ec8 commit c384610Copy full SHA for c384610
two-sum/changhyumm.py
@@ -0,0 +1,13 @@
1
+class Solution:
2
+ def twoSum(self, nums: List[int], target: int) -> List[int]:
3
+ # for i in range(len(nums)):
4
+ # for j in range(i+1, len(nums)):
5
+ # if nums[i] + nums[j] == target:
6
+ # return [i, j]
7
+ dic = dict()
8
+ for idx, num in enumerate(nums):
9
+ if target - num in dic:
10
+ return [idx, dic[target-num]]
11
+ else:
12
+ dic[num] = idx
13
+
0 commit comments