题解 | #和为S的连续正数序列#

class Solution {
public:
    vector<vector<int> > FindContinuousSequence(int sum) {
        vector<vector<int> > res;
        vector<int> temp;
        int i = 1;
        while(i + i + 1 <= sum){
            int t = 0;
            for(int j = i;t < sum;j++){
                t += j;
                temp.push_back(j);
                if(t == sum) res.push_back(temp);
            }
            temp.clear();
            i++;
        }
        return res;
    }
};//时间复杂度O √n