Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example: Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
Code
class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
mydict={}
rtnlist=[]
i=0
for item in nums:
if mydict.get(target-item)!=None:
rtnlist.append(mydict[target-item])
rtnlist.append(i)
else:
mydict[item]=i
i+=1
return rtnlist