Leetcode oj1 第一题 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, 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:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        for s,i in enumerate(nums[:len(nums)-1]):
            for s1,j in enumerate(nums[s+1:]):
                if i+j==target:
                    k=[s,s1+s+1]
                    return k