(太难了对于我,我只看了一小部分,侧开的话考的比较多) LC1:两数之和,找一个数组中目标值等于val的两数下标#暴力法 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);&nbs...