Given a 1-indexed sorted array numbers, find two numbers that add up to target. Return [index1, index2] (1-indexed). Exactly one solution exists.
Input: Sorted integer array numbers and integer target.
Output: [index1, index2] (1-indexed).
Input: [2,7,11,15],9
Output: [1,2]
Explanation: 2+7=9.Input: [2,3,4],6
Output: [1,3]
Explanation: 2+4=6.Input: [-1,0],-1
Output: [1,2]
Explanation: -1+0=-1.2<=numbers.length<=3*10^4-1000<=numbers[i]<=1000Exactly one solution.