(太難了對于我,我只看了一小部分,側(cè)開的話考的比較多) LC1:兩數(shù)之和,找一個數(shù)組中目標值等于val的兩數(shù)下標#暴力法 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] ...