algorithms/array/two_sum.py at master · QinTuCoding/algorithms · GitHub

29 lines (22 loc) · 661 Bytes

"""

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].

"""

def two_sum(nums:"List[int]", target:"int")->"List[int]":

dic = {}

for i, num in enumerate(nums):

if num in dic:

return [dic[num], i]

else:

dic[target - num] = i

if __name__ == "__main__":

arr = [3,2,4]

target = 6

res = two_sum(arr, target)

print(res)

Expand file tree