题目描述;
给定两个整数sum和n,要求在1, 2, 3, …, n中找到所有和为sum的组合.
eg: sum = 6, n = 6
1 2 3 4 5 6
输出:
6
5 + 1
4 + 2
3 + 2 + 1
分析:
使用递归的方式考虑,原问题可以分割为在你1, 2 , … , n -1中找和为sum - n的问题(sumOfNumber(sum - n, n - 1))和在1, 2, … , n - 1中找和为sum的问题(sumOfNumber(sum, n - 1)).
#include <iostream>
#include <vector>
using namespace std;
void sumOfNumber(int sum, int n);
vector<int> vec;
int main()
{
int sum, n;
cout << "Input n: ";
cin >> n;
cout << "Input sum: ";
cin >> sum;
sumOfNumber(sum, n);
return 0;
}
void sumOfNumber(int sum, int n)
{
if(n <= 0 || sum <= 0)
return ;
if((n * (n + 1))/2 < sum)
return ;
if(sum == n)
{
for(vector<int>::iterator it = vec.begin(); it != vec.end(); it++)
{
cout << *it << " + ";
}
cout << n << endl;
}
vec.push_back(n); //将n放入解数组,表示n是一个解.
sumOfNumber(sum - n, n - 1);
vec.pop_back(); //将n从解数组中删除,表示n不是一个解.
sumOfNumber(sum, n - 1);
}