题解 | #和为S的连续正数序列#暴力搜索O(n)，性能略差于滑动窗口

public:
    vector<vector<int> > FindContinuousSequence(int sum) {
        vector<vector<int>> a;
        int res = 0;
        if(sum == 0){
            return a;
        }
        
        for(int i = 1; i < sum; i++){
            int j = i;
            vector<int> tmp;
            res = 0;
            while(res <= sum){
                res += j;
                tmp.push_back(j);
                if(res == sum){
                    a.push_back(tmp);
                    break;
                }
                j++;
            }
        }
        return a;
    }
};