| English | 简体中文 |
1. Two Sum
Description
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.
Example 1:
Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6 Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6 Output: [0,1]
Constraints:
2 <= nums.length <= 104-109 <= nums[i] <= 109-109 <= target <= 109- Only one valid answer exists.
Follow-up: Can you come up with an algorithm that is less than
O(n2) time complexity?Related Topics
Similar Questions
- 3Sum
- 4Sum
- Two Sum II - Input Array Is Sorted
- Two Sum III - Data structure design
- Subarray Sum Equals K
- Two Sum IV - Input is a BST
- Two Sum Less Than K
- Max Number of K-Sum Pairs
- Count Good Meals
- Count Number of Pairs With Absolute Difference K
- Number of Pairs of Strings With Concatenation Equal to Target
- Find All K-Distant Indices in an Array
- First Letter to Appear Twice
- Number of Excellent Pairs
- Number of Arithmetic Triplets
- Node With Highest Edge Score
- Check Distances Between Same Letters
- Find Subarrays With Equal Sum
- Largest Positive Integer That Exists With Its Negative
- Number of Distinct Averages
- Count Pairs Whose Sum is Less than Target