"""Leetcode 1. Two Sum
Easy

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

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]

        Time complexity: O(n).
        Space complexity: O(n).
        """
        num_idx_d = {}
        for i, num in enumerate(nums):
            if target - num in num_idx_d:
                return [num_idx_d[target - num], i]
            num_idx_d[num] = i
        return []


def main():
    print Solution().twoSum([2, 7, 11, 15], 9)

if __name__ == '__main__':
    main()

@@ -347,17 +347,16 @@
 et = 9,%0A
-%0A
 Because 
@@ -675,18 +675,16 @@
 for i, n
-um
  in enum
@@ -721,18 +721,16 @@
 rget - n
-um
  in num_
@@ -780,18 +780,16 @@
 rget - n
-um
 %5D, i%5D%0A  
@@ -809,18 +809,16 @@
 _idx_d%5Bn
-um
 %5D = i%0A  
@@ -895,16 +895,17 @@
 5%5D, 9)%0A%0A
+%0A
 if __nam

Revise to var n & add space line