原题链接:https://leetcode-/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/
滑动窗口
vector<vector<int>> findContinuousSequence(int target) {int i = 1;//滑动窗口的左边界int j = 1;//滑动窗口的右边界int sum = 0;//滑动窗口中数字的和vector<vector<int>> res;while (i <= target / 2) {if (sum < target) {//右边界向右移动sum += j;j++;} else if (sum > target) {//左边界向右移动sum -= i;i++;} else {//记录结果vector<int> arr;for (int k = i; k < j; k++) {arr.push_back(k);}res.push_back(arr);sum -= i;//左边界向右移动i++;}}return res;}