1.Two Sum Leetcode Python

hyperbolechi

于 2015-01-27 01:04:51 发布

阅读量854

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/hyperbolechi/article/details/43178537

leetcode 专栏收录该内容

166 篇文章

订阅专栏

本文解析了如何通过哈希表解决两数之和问题，给出了一种高效查找方案，确保找到两个数相加等于目标值。介绍了算法实现的具体步骤，并提供了Python代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

这道题目来自于introduction to algorithm书上，介绍的是brute force的用法。

这里我们采用hashtable 将数值即为key value为index 将target-num[index]作为搜索条件。类似的题目还有4 sum

代码如下：

class Solution:
    # @return a tuple, (index1, index2)
    def twoSum(self, num, target):
        process={}
        for index in range(len(num)):
            if target-num[index] in process:
                return [process[target-num[index]]+1,index+1]
            process[num[index]]=index