LeetCode167 Two Sum II - Input array is sorted

题目：

       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:

              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.

本题采用双指针之对撞指针来解决此问题。首先使用两个指针指向数组头和尾，分别为l和r，当l和r位置的元素之和大于target，由于是有序数组，可以让r减一，如果l和r位置的元素之和小于target，则l加一，直到l和r位置的元素之和等于target，则返回索引素组，当r和l相等，并且题目要求两个元素不能是同一个，则此时表明这两个索引不存在。

public class SortedArrayTwoSumII {
    public static int[] twoSum(int[] numbers, int target) {
        if(numbers == null || numbers.length  < 2)
            return new int[]{-1, -1};

        int[] index = new int[2];
        index[0] = -1;
        index[1] = -1;
        int l = 0;
        int r = numbers.length -1;
        while(l < r){
            if (numbers[l] + numbers[r] > target)
                r--;
            else if (numbers[l] + numbers[r] < target)
                l++;
            else {
                index[0] = l;
                index[1] = r;
                return index;
            }
        }
        return index;
    }

    public static void main(String[] args) {
        int[] numbers = {2,7,11,15};
        int target = 9;
        System.out.println(Arrays.toString(twoSum(numbers, target)));
    }
}