两数之和,字典法
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
n=len(nums)
lookup={}
for i in range(0,n):
tmp=target-nums[i]
if tmp in lookup:
return [lookup[tmp],i]
lookup[nums[i]]=i