Two Sum

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.


Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        diff = {target-nums[i]:i for i in range(len(nums))}
        for n in range(len(nums)):
	        if nums[n] in diff and n != diff[nums[n]]:
		        return [n, diff[nums[n]]]

Leave a Reply

Your email address will not be published. Required fields are marked *