-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1-two-sum.py
More file actions
32 lines (26 loc) · 815 Bytes
/
1-two-sum.py
File metadata and controls
32 lines (26 loc) · 815 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
"""
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
"""
class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
table = {}
for i, val in enumerate(nums):
x = target - val
if x in table:
return [table[x], i]
else:
table[val] = i
return []
if __name__ == "__main__":
nums, target = [2, 7, 11, 15], 9
print(Solution().twoSum(nums, target))