对撞指针

twoSums解法2

int[] twoSums(int[] numbers,int target){
    int l = 0;
    int r = numbers.size()-1;
    while(l<r){
        if(numbers[l]+numbers[r]==target){
            int res[2] = {r,l};
            return res;
        }
        else if(numbers[l]+numbers[r]<target){
            l++;
        }
        else
            r--;
    }
    
}