#
# @lc app=leetcode.cn id=1 lang=python3
#
# [1] 两数之和
#
# @lc code=start
class Solution:
    def twoSum(self, nums, target):
        hash_map = dict()
        tp_rtn = list()
        for i,num in enumerate(nums):
            tp_add = target-num
            if tp_add in hash_map.keys():
                tp_rtn = [hash_map[tp_add],i]
                break
            else:
                hash_map[num] = i
        return tp_rtn    
# @lc code=end