LeetCode 1.Two Sum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.

Example1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Python解法一：

枚举nums，暴力解

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        for index , item in enumerate(nums):
        	for count in range(index+1,len(nums)):
        		if item + nums[count] == target:
        			return [index,count]
        			

解法2：
hashmap

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        hashmap = {}
        for index , item in enumerate(nums):
        	if target - item not in hashmap:
        		hashmap[nums[index]] = index   # 列表中的element做key，index做value
        	else:
        		return hashmap[target - item] , index