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

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