LeetCode題解 - 1. Two Sum [Easy]

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


Example:

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

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Code:

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        dict_number = {}
        for i in range(len(nums)):
            if nums[i] in dict_number:
                return [dict_number[nums[i]], i]
            else:
                dict_number[target - nums[i]] = i

心得:
沒想到過一天之後，程式碼就會自動消失
為了打這一篇心得，又重寫了一次…

看看下圖左邊高峰的大大們，會不會太離譜了！
只能跪了…