题目
给定若干个正整数 a[0],a[1],……,a[n-1],从中选出若干个数,使他们的和恰好为k,要求找出选择元素个数最少的解。
代码
#include <iostream>
#include <list>
#include <stdio.h>
using namespace std;
list<int> numList;
int minCount = -1;
void find_seq(int sum, int index, int * value, list<int> & seq)
{
if(sum <= 0 || index < 0) return;
if(sum == value[index])
{
printf("%d ", value[index]);
int n = 1;
for(list<int>::iterator iter = seq.begin(); iter != seq.end(); ++iter)
{
n++;
printf("%d ", *iter);
}
if(minCount == -1 || n < minCount)
{
minCount = n;
}
printf("\t(一共%d个元素)\n",n);
}
seq.push_back(value[index]);
find_seq(sum-value[index], index-1, value, seq); //放value[index]
seq.pop_back();
find_seq(sum, index-1, value, seq); //不放value[index]
}
int main()
{
int k;
list<int> seq;
int value[] = {2,9,5,7,4,11,10};
int N = sizeof(value)/sizeof(value[0]);
printf("正整数集合为::");
for(int i = 0; i < N; ++i)
{
printf("%d ",value[i]);
}
printf("\n请输入k的值:");
scanf("%d", &k);
printf("可能的序列如下:\n");
find_seq(k, N-1, value, seq);
if(minCount == -1)
{
printf("没有能够相加为%d的组合\n",k);
}
else
{
printf("最少的组合元素为:%d,组合详情见上\n",minCount);
}
return 0;
}
以下为我的微信公众号:技术经理的成长
会不定期进行更新,欢迎关注