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

class Solution {
public:
    vector<int> FindNumbersWithSum(vector<int> array,int sum) {
        vector<int> b;
        if(array.size()<=1) return b;
        int k=0,a=array.size()-1;
        for(;k<a;k++){
            for(;a>k;a--){
                if(array[k]+array[a]>sum) continue;
                if(array[k]+array[a]<sum) break;
                b.push_back(i);
                b.push_back(j);
                goto cc;
            }
        }
        cc: return b;
    }
};