剑指 Offer 57 - II. 和为s的连续正数序列

思路：利用滑动窗口法(没有想到) 根据K神的思路

 

 

class Solution {
public:
    vector<vector<int>> findContinuousSequence(int target) {
        vector<vector<int>> res;
        if(target <= 2) return res;
        int i = 1, j = 2, sum = 3;//i 滑窗的左边 j滑窗的右边
        while(i <= target/2)
        {
            if(sum == target) 
            {
                vector<int> temp;
                for(int k = i; k <= j; k++)
                {
                    temp.push_back(k);
                }
                res.push_back(temp);
            }
            if(sum>=target) //左窗向右边滑动
            {
                sum -= i;
                i++;
            }
            else //右窗向右滑动
            {
                j++;
                sum += j;
            }
        }
        
        return res;

    }
};