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

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