剑指offer系列- 57 II 和为s的连续正数序列

class Solution {
public:
    vector<vector<int>> findContinuousSequence(int target) {
        vector<vector<int>> res;
        int left=1;
        int right=left+1;
        vector<int> ans;
        // 达到（1+target）/ 2时left==right就会结束
        while(left<right){
            int sum=(left+right)*(right-left+1)/2;
            if(sum<target)
                right++;
            else if(sum>target)
                left++;
            else{
                ans.clear();
                for(int i=left;i<=right;i++)
                    ans.push_back(i);
                res.push_back(ans);
                left++;
            }
        }
        return res;
    }
};