leetcode 1. 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.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

注意：

1.返回值是下标，不是数字

#encoding=utf-8
class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        for i in range(len(nums)):
            
            for j in range(i+1,len(nums)):
                
                if nums[i] + nums[j] == target:
                    return i,j

nums=[3,2,4]
target = 6
s=Solution()
print s.twoSum(nums,target)