class Solution {
public:
vector<vector<int> > FindContinuousSequence(
int sum) {
vector<vector<int>> result;
int hign=
2,low=
1;
while(hign>low)
{
int cur=(hign+low)*(hign-low+
1)/
2;
if(cur<sum)
{
hign++;
}
if(cur==sum)
{
vector<int>res;
for(
int i=low;i<=hign;i++)
{
res.push_back(i);
}
result.push_back(res);
low++;
}
if(cur>sum)
{
low++;
}
}
return result;
}
};
