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

【題目大意】

在一個整陣列成的字串中找到兩個數，使得兩個數的和為目標引數。

使用Hash表，在表中nums[i]儲存i下標，每次檢測target-nums[i] 有沒有在表中。

【Code】

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        temp = {}
        for i in range(len(nums)):
            if nums[i] not in temp:
                temp[nums[i]] = i
            if target-nums[i] in temp.keys() and temp[target-nums[i]]!=i:
                # 防止再一次檢測到自身
                return [temp[target-nums[i]], i]
 

 人生苦短，我用python。