leetcode-01两数之和

'''
设定x,y两个值，y = target目标值 - x
然后遍历。
'''

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        if nums == None: return -1
        length = len(nums)
        for i in range(length):
            x = nums[i]
            y = target - x
            j = i+1
            for index, result in enumerate(nums[j:]):
                if result == y:
                    return [i, index+j]

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

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

print(s.twoSum(nums, target))