Python/other/two_sum.py

48 lines
1.1 KiB
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].
"""
from __future__ import annotations
2019-10-05 05:14:13 +00:00
def two_sum(nums: list[int], target: int) -> list[int]:
2017-10-22 23:06:45 +00:00
"""
>>> two_sum([2, 7, 11, 15], 9)
[0, 1]
>>> two_sum([15, 2, 11, 7], 13)
[1, 2]
>>> two_sum([2, 7, 11, 15], 17)
[0, 3]
>>> two_sum([7, 15, 11, 2], 18)
[0, 2]
>>> two_sum([2, 7, 11, 15], 26)
[2, 3]
>>> two_sum([2, 7, 11, 15], 8)
[]
>>> two_sum([3 * i for i in range(10)], 19)
[]
2017-10-22 23:06:45 +00:00
"""
chk_map = {}
for index, val in enumerate(nums):
2019-10-05 05:14:13 +00:00
compl = target - val
if compl in chk_map:
return [chk_map[compl], index]
chk_map[val] = index
return []
if __name__ == "__main__":
import doctest
doctest.testmod()
print(f"{two_sum([2, 7, 11, 15], 9) = }")