每日一题：和为s的连续正整数序列

输入一个正整数 target ，输出所有和为 target 的连续正整数序列（至少含有两个数）。

输入：target = 9
输出：[[2,3,4],[4,5]]

输入：target = 15
输出：[[1,2,3,4,5],[4,5,6],[7,8]]

直接使用滑动窗口法，将时间复杂度控制在O(n)

class Solution {
public:
    vector<vector<int>> findContinuousSequence(int target) {
        vector<vector<int> > result;
        int indexHead = 1, indexTail = 1, subSum = 1;

        while (indexHead <= target - 1){
            if (subSum == target){
                vector<int> temp(indexHead - indexTail + 1);
                for (int i = indexTail; i <= indexHead; i++){
                    temp[i - indexTail] = i;
                }
                result.push_back(temp);
                indexHead++;
                subSum += indexHead;
            }
            else if (subSum < target){
                indexHead++;
                subSum += indexHead;
            }
            else if (subSum > target){
                subSum -= indexTail;
                indexTail++;
            }
        }
        return result;
    }
};