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].
python实践：
使用hash表的存储方式， 字典
#!/usr/bin/env python
# _*_ coding:utf-8 _*_
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
# 1. 定义一个字典，key：nums中的元素，value：具体索引值
d = {}
for i in range(0, len(nums)):
if target - nums[i] in d:
return [d[target-nums[i]], i]
else:
d[nums[i]] = i
if __name__ == '__main__':
nums = [2, 7, 11, 15]
target = 9
Solution().twoSum(nums, target)
