题解 | 和为S的连续正数序列

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param sum int整型 
     * @return int整型vector<vector<>>
     */
    vector<vector<int> > FindContinuousSequence(int sum) {
        int left = 1;
        int right = 2;
        vector<vector<int>> res;
        while(left < right){
            int cur = (left + right) *(right - left + 1) / 2;
            if(sum == cur){
                vector<int> tmp;
                for(int i = left; i <= right; i++){
                    tmp.push_back(i);
                }
                res.push_back(tmp);
                right++;
            }
            else if(sum > cur){
                right++;
            }
            else{
                left++;
            }
        }
        return res;
        
        // write code here
    }
};