#1 Two Sum

熊怪要变码农啦

已于 2022-02-20 21:44:11 修改

阅读量159

点赞数

分类专栏： # LeetCode Hot 文章标签： python pycharm 数据结构算法 leetcode

于 2022-02-18 02:29:00 首次发布

本文链接：https://blog.csdn.net/yzh3558/article/details/122995207

版权

LeetCode Hot 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

本文介绍了一种Python实现的方法，用于在一个整数数组`nums`中找到两个数，它们的和等于目标值`target`。通过使用哈希表（字典）记录每个数的补数，可以在O(n)的时间复杂度内找到解决方案，且不重复使用同一元素。

摘要由CSDN通过智能技术生成

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.

class Solution:
    def twoSum(self, nums, target):

        d = {}

        for i in range(len(nums)):
            complement = target - nums[i]

            # if nums[i] is a complement of another number, return their indices
            if nums[i] in d:
                return [d[nums[i]], i]
            # else: record its complement and index
            else:
                d[complement] = i