Problem Brief
Two Sum
OA
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.
1Example 1
Input
nums = [2,7, 11, 15], target = 9
Output
[0, 1]
Explanation
Because nums[0] + nums[1] == 9, we return [0, 1].
2Example 2
Input
nums = [2,7], target = 9
Output
[0, 1]
Explanation
Because nums[0] + nums[1] == 9, we return [0, 1].
Constraints
Limits and guarantees your solution can rely on.
2 <= nums.length <= 10-10 <= nums[i] <= 10-10 <= target <= 10- Only one valid answer exists.