和为s的连续整数序列

2019独角兽企业重金招聘Python工程师标准>>>

// test26.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include<iostream>
#include<vector>
using namespace std;

vector<vector<int> > find(vector<int> vec , int num)
{
	vector<vector<int> > vecs;
	vector<int> vector;
	if(vec.size() == 0)
		return vecs;
	int sum = 0;
	for(int i = 0 ;i < vec.size();i++)
	{
		sum += vec[i];
		vector.push_back(vec[i]);
		if(sum == num)
		{
			vecs.push_back(vector);
			sum -= vector.front();
			vector.erase(vector.begin());
		}
		else if(sum > num)
		{
			while(sum > num)
			{
				sum -= vector.front();
				vector.erase(vector.begin());
			}
			if(sum == num)
			{
				vecs.push_back(vector);
				sum -= vector.front();
				vector.erase(vector.begin());
			}

		}
		if(vec[i] > num)
			break;
	}
	return vecs;
}


int main(int argc, char* argv[])
{
	vector<int> vec;
	vec.push_back(1);
	vec.push_back(2);
	vec.push_back(3);
	vec.push_back(4);
	vec.push_back(5);
	vec.push_back(6);
	vec.push_back(7);
	
	vector<vector<int> > vecs = find(vec,18);
	for(int i = 0 ;i < vecs.size() ; i ++)
	{
		for(int j = 0 ; j < vecs[i].size(); j ++)
			cout<<vecs[i][j]<<"  ";
		cout<<endl;
	}
	return 0;
}

转载于:https://my.oschina.net/liangxiao/blog/161604