Sword To Offer 041 - 和为S的连续正数序列

class Solution {
public:
    vector<vector<int> > FindContinuousSequence(int sum) {
        vector<vector<int>> result;
        vector<int> currentVector;
        int currentSum = 0;
        for(int i = 1; i <= sum; i++) {
            currentSum += i;
            currentVector.push_back(i);
            if(sum == currentSum && currentVector.size() >= 2) {
                result.push_back(currentVector);
            }
            bool change = false;
            while(currentSum > sum) {
                int front = currentVector.front();
                currentVector.erase(currentVector.begin());
                currentSum -= front;
                change = true;
            }
            if(sum == currentSum && currentVector.size() >= 2 && change) {
                result.push_back(currentVector);
            }
        }
        return result;
    }
};