输出所有和为S的连续正数序列。序列内按照从小至大的顺序，序列间按照开始数字从小到大的顺序

例：输入为18时，输出为3,4,5,6/5,6,7

#include<vector>#include<iostream>using namespace std;//ways1: 遍历,暴力求解vector<vector<int> > FindContinuousSequence_(int sum) {           vector<vector<int> > c;   int temp=0;   int p=0;   for( int j=1;j<=(sum+1)/2;j++){     for(int i=j;i<=(sum+1)/2;i++){      temp=temp+i;      if(temp==sum){           vector<int> ac;          for(int k=j;k<=i;k++)          ac.push_back(k);                               c.push_back(ac);       break;     }  }   temp=0;  }     return c; }//ways2: 选取连续数字的首尾两端，若相加大于sum，则右侧减少；若相加小于sum,则左侧增加。vector<vector<int> > FindContinuousSequence(int sum) {     vector<vector<int>> res;     if(sum < 3 )       return res;     int i = 1, j = 2, mid = (sum+1)/2, cur = i+j;        while(i<j && j<=mid){            if(cur == sum){                vector<int> aRes;                for(int k=i; k<=j; k++)                    aRes.push_back(k);                res.push_back(aRes);                cur += ++j;            }            else if(cur < sum){                cur += ++j;            }            else{                cur -= i++;            }        }        return res;}void main(){    vector<vector<int> > m=FindContinuousSequence(100);//    for(int i=0;i<m.size();i++)        for(int j=0;j<m[i].size();j++){            cout<<m[i][j]<<"  ";        }        cout<<endl;    while(1);}

吾身还需继续感悟算法的博大精深。