Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1]
//给定一个数组与目标值,使列表中两数相加等于目标值,返回值为两数在列表中的位置。
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
dict = {}
for i in range(len(nums)):
if nums[i] not in dict:
dict[target-nums[i]] = i
elif nums[i] in dict:
return[dict[nums[i]],i]