Solution

• 双指针

class Solution {
public:
    vector<int> FindNumbersWithSum(vector<int> array,int sum) {
        vector<int> res;
        int n = array.size();
        if (n == 0) return res;
        
        int l = 0, r = n - 1;
        int multi = INT_MAX;
        while (l <= r) {
            int curSum = array[l] + array[r];
            if (curSum == sum) {
                if (array[l] * array[r] < multi) {
                    multi = array[l] * array[r];
                    res.clear();
                    res.push_back(array[l]);
                    res.push_back(array[r]);
                }
                l++;
            }
            else if (curSum > sum) r--;
            else l++;
        }
        return res;
    }
};