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

解法1 暴力搜素 :

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        list_ans=[]
        for first in range(0,len(nums)) :
            val = target-nums[first]
            for second in range(first+1,len(nums)) :
                if nums[second]==val :
                    list_ans.append(first)
                    list_ans.append(second)

        return list_ans

虽然accept了，但是执行时间惨不忍睹

解法2 哈希表存储:

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        list_ans=[]
        hash_map={}
        for each in range(0,len(nums)) :
            if hash_map.has_key(str(target-nums[each])) :
                list_ans.append(hash_map[str(target-nums[each])])
                list_ans.append(each)
            else :
                hash_map[str(nums[each])]=each

        return list_ans

Accept:速度快了很多，减少了重复计算