Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target, in ascending order.
Each input has exactly one solution, and you may not use the same element twice.
Example 1
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: nums[0] + nums[1] = 2 + 7 = 9
Example 2
Input: nums = [3,2,4], target = 6
Output: [1,2]
Constraints
2 <= nums.length <= 10000-1000000 <= nums[i] <= 1000000Follow-up: the brute-force solution checks every pair in O(n²). Can you do it in a single pass?
Input
nums = [2,7,11,15], target = 9
Expected
[0,1]
4 hidden tests run on submit