LeetC0der

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):         """         :type nums: List[int]         :type target: int         :rtype: List[int]         """         tmp=dict()         result=list()         for i,ele in enumerate(nums):             if ele not in tmp:                 tmp[ele]=i             if target-ele in tmp and i!=tmp[target-ele]:                 result.append(tmp[target-ele])                 result.append(i)                 return result         

1.最粗暴的方式咱就不谈了。

2.一遍过