LeetCode Two Sum II - Input array is sorted(Two pointer问题)

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. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9

Output: index1=1, index2=2

题意:给出一个数组（升序）和一个目标数，求数组中的两个数相加正好等于目标数的两个元素的下标

思路：用left表示左边下标， right表示右边下标，如果numbers[left]+numbers[right]<target，则left++,如果numbers[left]+numbers[right]>target，则right--.如果正好相等，就退出，找到了对应的元素下标

代码如下：

public class Solution
{
    public int[] twoSum(int[] numbers, int target)
    {
        int left = 0, right = numbers.length - 1;
        int[] ans = new int[2];
        while (left < right) {
            if (numbers[left] + numbers[right] < target) {
                left++;
            } else if (numbers[left] + numbers[right] > target) {
                right--;
            } else {
                ans[0] = left + 1; ans[1] = right + 1;
                break;
            }
        }

        return ans;
    }
}