【leetcode-001】 Two-Sum

类型：hash table

题目

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

class Solution(object):
    def twoSum(self, lst, target):
        lookup = {}
        for index, num in enumerate(lst):
            if target - num in lookup:
                return [lookup[target - num], index]
            lookup[num] = index

if __name__ == '__main__':
    print(Solution().twoSum((2, 7, 11, 15), 9))