题解 | 和为S的两个数字

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


    }
};