LeetCode刷题-1——Two sum(两数之和)

链接：

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

解析：

• 定义一个空字典，values存储nums数组索引，keys存储nums数据的值
• 循环整个数组，判定target-num[i]是否在字典在，在执行相应操作

解答：

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