输入一个正整数 target ，输出所有和为 target 的连续正整数序列（至少含有两个数）。
    序列内的数字由小到大排列，不同序列按照首个数字从小到大排列。

    示例 1：

    1. 输入：target = 9
    2. 输出：[[2,3,4],[4,5]]

    示例 2：

    输入：target = 15
输出：[[1,2,3,4,5],[4,5,6],[7,8]]

    限制：

    • 1 <= target <= 10^5

      class Solution {
public:
  vector<vector<int>> findContinuousSequence(int target) {
      vector<vector<int>> res;
      if(target < 3) return res;
      int small = 1;
      int big = 2;
      int middle = (1 + target) / 2;
      int curSum = small + big;
      while(small < middle){
          if(curSum == target){
              vector<int> temp;
              for(int i = small; i <= big; i++){
                  temp.push_back(i);
              }
              res.push_back(temp);
          }
          while(curSum > target && small < middle){
              curSum -= small;
              small++;
              if(curSum == target){
                  vector<int> temp;
                  for(int i = small; i <= big; i++){
                      temp.push_back(i);
                  }
                  res.push_back(temp);
              }
          }
          big++;
          curSum += big;
      }
      return res;

  }
};