leetcode Two Sum II - Input array is sorted <面试常考题>

题目描述

//二分查找的变形   用头尾两个指针进行  面试考察题

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        vector<int>  ret;
        if(numbers.size() == )
            return ret;
        int i = ;
        int j = numbers.size() -;

        while(i < j){
            if(numbers[i] + numbers[j] == target){
                ret.push_back(i+);
                ret.push_back(j+);
                return ret;
            }
            if(numbers[i] + numbers[j] > target){
                j--;
            }
            if(numbers[i] + numbers[j] < target){
                i++;
            }
        }
        return ret;
    }
};