[1] Two Sum

https://leetcode.com/problems/two-sum/description/

• algorithms
• Easy (39.31%)
• Source Code: 1.two-sum.py
• Total Accepted: 1.7M
• Total Submissions: 3.9M
• Testcase Example: '[2,7,11,15]\n9'

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].

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        table = {}
        for idx, n in enumerate(nums):
            table[n] = idx

        for idx, n in enumerate(nums):
            other = target - n
            if other in table and not table[other] == idx:
                return [idx, table[other]]

        return [0, 1]