剑指 Offer 57 - II. 和为s的连续正数序列

vector<vector<int>> findContinuousSequence(int target) { vector<vector<int>> ret; vector<int> temp; int l = 1, r = 1; int total = 0; bool flag = false; while (r < target) { if (!flag) { temp.emplace_back(r); total += r++; } if (total == target) { ret.emplace_back(temp); temp.erase(temp.begin()); total -= l++; flag = false; } else if (total < target) { flag = false; } else { flag = true; temp.erase(temp.begin()); total -= l++; } } return ret; }