1. 两数之和_Two Sum

最新推荐文章于 2023-06-27 22:30:33 发布

「已注销」

最新推荐文章于 2023-06-27 22:30:33 发布

阅读量84

点赞数

分类专栏： LeetCode学习

本文链接：https://blog.csdn.net/qq_15706279/article/details/100585103

版权

LeetCode学习专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Two Sum

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.

给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那两个整数，并返回他们的数组下标。

你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。

题目来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/two-sum

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

python3:

from typing import List

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        possible_result = {}
        for i in range(len(nums)):
            if possible_result.get(target - nums[i]) is not None:
                return [possible_result.get(target - nums[i]), i]
            else:
                possible_result[nums[i]] = i
        return None