Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

    The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.

    Note:

    • Your returned answers (both index1 and index2) are not zero-based.

    • You may assume that each input would have exactly one solution and you may not use the same element twice.

    Example:

    1. Input: numbers = [2,7,11,15], target = 9
    2. Output: [1,2]
    3. Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
    /**
 * @param {number[]} numbers
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(numbers, target) {
    const len = numbers.length;
    let i = 0;
    let j = len - 1;
    let sum = 0;
    while(i < len) {
        sum = numbers[i] + numbers[j];
        if (sum === target) {
            return [i + 1, j + 1];
        }
        if (sum < target) {
            i++;
        } else {
            j--;
        }
    }
};