Leetcode-Two Sum

最新推荐文章于 2022-02-22 16:28:55 发布

wenmin.wu

最新推荐文章于 2022-02-22 16:28:55 发布

阅读量443

点赞数

分类专栏： leetcode 文章标签： leetcode algorithm python

本文链接：https://blog.csdn.net/u010306433/article/details/44560513

版权

leetcode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

问题

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9

Output: index1=1, index2=2

思路

看到这个题直接的思路是用一个二重循环，任取数组中的两个值相加后与目标值比较。复杂度是 $O(n^2)$ 。更聪明的想法是利用目标值的信息，遍历数组，寻找 $target-number$ 。那么如何降低这个查找复杂度呢？我们知道HashTable的isExist 复杂度为 $O(1)$ 。这使得整个算法的复杂度变为 $O(n)$ 。下面给出python 的源码实现。

源码

class Solution:
    # @return a tuple, (index1, index2)
    def twoSum(self, num, target):
        valueToIndices = dict()
        for index, value in enumerate(num):
            valueToIndices.setdefault(value, set())
            valueToIndices[value].add(index)
        for i in xrange(len(num)):
            expectedValue = target - num[i]
            if expectedValue in valueToIndices:
                indices = valueToIndices[expectedValue]
                if i in indices:
                    indices.remove(i)
                if indices:
                    return (i+1, indices.pop()+1)