Given an array of integers numbers 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 must return the answer in ascending order.
Example 1
Input: numbers = [2, 7, 11, 15], target = 9
Output: [0, 1]
Explanation: numbers[0] + numbers[1] = 2 + 7 = 9, we return [0, 1]
Example 2
Input: numbers = [3, 2, 4], target = 6
Output: [1, 2]
Example 3
Input: numbers = [3, 3], target = 6
Output: [0, 1]
Constraints
0 <= numbers.length <= 1000000
-1000000 <= numbers[i] <= 1000000
-1000000 <= target <= 1000000
Only one valid answer exists