题意:数组中是否存在两个数 之和等于给定数
思路:割草原理
Code:
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
dct = {}
for i, n in enumerate(nums):
if target - n in dct:
return [dct[target - n], i]
dct[n] = i
return -1