代码:
"""
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].
"""
class Solution(object):
def twoSum(self, numbers, target):
# 定义字典
dic = dict()
# 循环len(numbers)次
for i in range(0, len(numbers)):
# 差值
sub = target - numbers[i]
# 若差值已经在字典中,则返回字典对应的value
if sub in dic.keys():
return [dic[sub], i]
else:
dic[numbers[i]] = i
运行结果:
t = Solution()
print(t.twoSum([1,2,3,4,5,6], 3))