题解 | #和为S的两个数字#

class Solution {
public:
    vector<int> FindNumbersWithSum(vector<int> array,int sum) {
        if(array.size()<2) return {};
        int left=0,right=array.size()-1;
        while(left<right){
            if((array[left]+array[right])>sum) right--;
            else if((array[left]+array[right])<sum) left++;
            else return {array[left],array[right]};
        }
        return {};
    }
};