2023.12.28 leedcode 两数之和

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        for i in range(len(nums)):
            if target - nums[i] in nums[i + 1 :]:
                if i != nums.index(target - nums[i]):
                    return [i, nums.index(target - nums[i])]
                elif i == nums.index(target - nums[i]):
                    nums.pop(i)
                    return [i, nums.index(target - nums[i]) + 1]