算法数组内数相加等于某一个数

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].

var = dict((nums[i], i) for i in range(len(nums)))
for i in range(len(nums)):
num2 = target-nums[i]
if num2 in var and not i == var[num2]:
return [i,var[num2]]
####################
class Solution:

def twoSum(self, nums, target):
    """
    :type nums: List[int]
    :type target: int
    :rtype: List[int]
    """

    recs = dict((num, i) for i, num in enumerate(nums))

    for i, num in enumerate(nums):
        j = recs.get(target - num)
        if j and not j == i:
            return [i, j]