DamiCode 1 两数之和 1 两数之和 class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: if len(nums) == 0: return [] for index,item in enumerate (nums): for count in range(index + 1,len(nums)): if item + nums[count] == target: return [index,count]