1.Two Sum

最新推荐文章于 2019-06-02 15:51:25 发布

shangqing.liu

最新推荐文章于 2019-06-02 15:51:25 发布

阅读量123

点赞数 1

分类专栏：算法

本文链接：https://blog.csdn.net/qq_33791052/article/details/83214659

版权

算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

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

class Solution(object):
    def twoSum(self, nums, target):
        if len(nums) <= 1:
            return False
        buff_dict = {}
        for i in range(len(nums)):
            if nums[i] in buff_dict:
                return [buff_dict[nums[i]], i]
            else:
                buff_dict[target - nums[i]] = i