leetcode--Two Sum

代码：

"""
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, nums, target):
        dic = dict()
        # enumerate将其组成一个索引序列，利用它可以同时获得索引和值
        for index, value in enumerate(nums):
            sub = target - value
            if sub in dic:
                return [dic[sub], index]
            else:
                dic[value] = index

t = Solution()
print(t.twoSum([1,2,3,4,5,6], 7))

运行结果：

[0, 1]