题目描述
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].
分析
采用字典映射的存储结构map={ }; 遍历输入数组时,同时读取索引值和对应的数字:enumerate(nums).
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
map={}
for a,num in enumerate(nums):
if num in map:
return [map[num],a]
else:
map[target-num]=a