acwing 76. 和为S的连续正数序列

class Solution {
public:
    
    
vector<vector<int> > vv;

vector<vector<int> > findContinuousSequence(int sum) {
    int l = 0; int r = 0;
    vector<int> nums;
    for (int i = 1; i <= sum / 2 + 1; i++) {
        nums.push_back(i);
    }

    int tmpSum = nums[l];

    while (l < nums.size() && r < nums.size() && l <= r) {
        if (tmpSum > sum) { tmpSum -= nums[l]; l++; continue; }
        else if (tmpSum < sum) {
            tmpSum += nums[r+1]; r++; continue;
        }
        else if (tmpSum == sum) {
            vector<int> v;
            for (int i = l; i <= r; i++) {
                v.push_back(nums[i]);
            }
            vv.push_back(v);
            if (r < nums.size() - 1)
                tmpSum += nums[r + 1]; 
            r++; continue;
        }
    }

    return vv;
}


};