class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
d = {}
for i in range(len(nums)):
if nums[i] in d:
return [d[nums[i]], i]
d[target - nums[i]] = i
return
leetcode——1. 两数之和
最新推荐文章于 2024-05-12 22:24:59 发布