直接代码:
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
hashmap={}
for index,num in enumerate(nums):
hashmap[num]=index
for index,num in enumerate(nums):
nu=target-num
if nu in hashmap.keys() and index!=hashmap[nu]:
return [index,hashmap[nu]]
其实就是使用了哈希查找的思想,不过这种方法消耗的内存过大,我正在想办法调整…