Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

1: 两数之和 #4

Open
damonyoungcc opened this issue Aug 11, 2022 · 0 comments
Open

1: 两数之和 #4

damonyoungcc opened this issue Aug 11, 2022 · 0 comments
Labels
algorithm🚀 算法 Easy 难度:简单

Comments

@damonyoungcc
Copy link
Contributor

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

你可以假设每种输入只会对应一个答案。但是,数组中同一个元素在答案里不能重复出现。

你可以按任意顺序返回答案。

链接:https://leetcode.cn/problems/two-sum

输入:nums = [2,7,11,15], target = 9
输出:[0,1]
解释:因为 nums[0] + nums[1] == 9 ,返回 [0, 1] 。

输入:nums = [3,2,4], target = 6
输出:[1,2]

输入:nums = [3,3], target = 6
输出:[0,1]

@GOWxx GOWxx added the Easy 难度:简单 label Aug 16, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
algorithm🚀 算法 Easy 难度:简单
Projects
None yet
Development

No branches or pull requests

2 participants