leetcode第一题 求解两数之和 暴力破解法

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