Leetcode_有序数组的 Two Sum

Input: numbers={2, 7, 11, 15}, target=9 Output: index1=1, index2=2

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int arr[] = new int[2];
        int i=0;
        int j=numbers.length-1;
        while(i<j){
            if(numbers[i]+numbers[j]==target){
                arr[0]=i+1;
                arr[1]=j+1;
                return arr;
            }else if(numbers[i]+numbers[j]<target){
                i++;
            }else{
                j--;
            }
        }
        return arr;
    }
}

 

其实就是双指针而已