【Python3学习笔记】LeetCode twosum解题

题目

给一个数组 nums[]，再给一个target，如果nums里的两个数字nums[i]+nums[j] = target，则return i,j
例子：

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

解决方法，for循环找出所有可能的组合，判断后return

class Solution:
    def twoSum(self, nums, target):
        for i in range(len(nums)):
            for j in range(i+1, len(nums)):
                if (nums[i] + nums[j]) == target:
                    return [i, j]