Python/other/two_sum.py

32 lines
723 B
Python
Raw Normal View History

2017-10-22 23:06:45 +00:00
"""
Given an array of integers, return indices of the two numbers such that they add up to
a specific target.
2017-10-22 23:06:45 +00:00
You may assume that each input would have exactly one solution, and you may not use the
same element twice.
2017-10-22 23:06:45 +00:00
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
"""
2019-10-05 05:14:13 +00:00
2017-10-22 23:06:45 +00:00
def twoSum(nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
chk_map = {}
for index, val in enumerate(nums):
2019-10-05 05:14:13 +00:00
compl = target - val
if compl in chk_map:
indices = [chk_map[compl], index]
print(indices)
return [indices]
else:
chk_map[val] = index
2017-10-22 23:06:45 +00:00
return False