leetcode---1.两数至和

class Solution:
    def twoSum(self, nums, target):
        hashmap={}
        for i,j in enumerate(nums):
            res=target-j
            hashmap[j]=i
            if res in hashmap:
                return [hashmap[res],i]