Leetcode 1. Two Sum

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        for i in range(len(nums)):
            for j in range(i+1,len(nums)):
                if target== nums[i]+nums[j]:
                    tmp=[]
                    tmp.append(i)
                    tmp.append(j)
                    return tmp
                    break