Two Sum
Easy
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.
Examples:
Example 1:
Input:[2, 7, 11, 15], 9
Output:[0, 1]
Explanation:nums[0] + nums[1] = 9
Example 2:
Input:[3, 2, 4], 6
Output:[1, 2]
Constraints:
- 2 <= nums.length <= 10^4
- -10^9 <= nums[i] <= 10^9
- -10^9 <= target <= 10^9
- Only one valid answer exists.
Limits:
Time limit: 2000 ms
Memory limit: 128 MB
Topics
Array
Loading editor...
▶
Run your code to test against examples