【Leetcode】167. 两数之和 II - 输入有序数组（Two Sum II - Input array is sorted）

Leetcode - 167 Two Sum II - Input array is sorted (Easy)

题目描述：给定一个升序数组，找到两个数使得两数之和为 target。

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

public int[] twoSum(int[] numbers, int target) {
    int left = 0, right = numbers.length - 1;
    while (left < right) {
        if (numbers[left] + numbers[right] == target) {
            return new int[]{left + 1, right + 1};
        } else if (numbers[left] + numbers[right] < target) {
            left++;
        } else {
            right--;
        }
    }
    return new int[]{};
}