两数之和—python 方法一:暴力枚举 搜寻target-num[i] = x 在nums中是否有匹配项 复杂度O(n^2) class Solution: def twoSum(self, nums: List[int], target: int) -> List[int