167.两数之和Ⅱ

二分法

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int n=numbers.length;
        int low=0;
        int high=numbers.length-1;
        while(low<=high){
            if((numbers[low]+numbers[high])==target){
                return new int[]{low+1,high+1};  
            }else if((numbers[low]+numbers[high])>target){
                high--;
            }else{
                low++;
            }
        } 
        return new int[]{-1,-1};
    }
}