卖萌的弱渣

I am stupid, I am hungry.

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.

Example:

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

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

Solution

  • 不要一上来把hash_map填满，不需要nums排序
(Two-Sum.py) download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        hash_map = dict()
        i = 0
        j = len(nums)-1

        for i in range(len(nums)):
            if (target-nums[i]) in hash_map :
                return [hash_map[target-nums[i]], i]
            hash_map[nums[i]] = i