题解 | 两数之和

class Solution:
    def twoSum(self , numbers: List[int], target: int) -> List[int]:
        # # write code here
        # 暴力做法超时
        # for i in range(len(numbers)):
        #     temp = target-numbers[i]
        #     if target-numbers[i] in numbers[i+1:]:
        #         return [i+1,numbers[i+1:].index(target-numbers[i])+2]
        # 哈希表做法  用dict字典
        res = []
        hash = {}
        for i in range(len(numbers)):
            temp = target - numbers[i]
            if temp not in hash:
                hash[numbers[i]]=i+1
            # 这里的else换成if temp in hash:就过不了 
            else:
                # 这个temp的索引值
                res.append(hash[temp])
                res.append(i+1)
                break
        return res