[leetcode] sum of two numbers [1]

problem :  Given an array of integers nums And an integer target value target, Please find the sum in the array as the target value target The two integers of , And return their array subscripts ( Be careful : The same element in the array cannot be repeated in the answer )

Example 1

Input : nums = [2,7,11,15], target = 9
Output : [0,1]
explain : because nums[0] + nums[1] == 9, return [0, 1]

Example 2

Input : nums = [3,2,4], target = 6
Output : [1,2] 

Example 3

Input : nums = [3,3], target = 6
Output : [0,1] 

python3 Problem solving  

def twoSum(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]

twoSum([2,7,11,15],9) # [0, 1]
twoSum([3,2,4],6) # [1, 2]
twoSum([3,3],6) # [0, 1]