题目:
#include <stdio.h>
#include <string.h>
int result[10];
int CurrentNum = 0;
int ValidSize(){
int size = 0;
for (int i = 1; i <= 9; i++)
{
if (result[i]) size++;
}
//printf("the size now is %d\n",size);
return size;
}
int Sum(){
int sum;
for (int i = 1; i < 10; i++)
{
if (result[i]) sum += result[i];
}
//printf("the sum now is %d\n",sum);
return sum;
}
void CombineSum(int k,int n,int start){
if (ValidSize() == k && Sum() == n)
{
for (int t = 1; t <= k; t++)
{
printf("%d",result[t]);
}
printf("\n");
return;
}
for (int i = start; (k - ValidSize() < 9-i+1) && Sum() < n; i++)
{
result[++CurrentNum] = i;
CombineSum(k,n,i+1);
result[CurrentNum--] = 0;
}
}
int main()
{
int n,k;
memset(result,0,sizeof(result));
scanf("%d %d",&k,&n);
CombineSum(k,n,1);
system("pause");
return 0;
}
没有输出,不知道为什么
这是加了两条调试语句的输出:
不知道是不是for循环剪枝那里出问题了?还是sum函数有问题(输出的sum和回溯算法模拟的不一样)?
#include <stdio.h>
#include <string.h>
int result[10];
int CurrentNum = 0;
int ValidSize(){
int size = 0;
for (int i = 0; i <= 9; i++) // 从下标0开始计算
{
if (result[i]) size++;
}
//printf("the size now is %d\n",size);
return size;
}
int Sum(){
int sum = 0; // 初始化
for (int i = 0; i < 10; i++) // 从数组下标0开始计算
{
if (result[i]) sum += result[i];
}
//printf("the sum now is %d\n",sum);
return sum;
}
void CombineSum(int k,int n,int start) {
if (ValidSize() > k) { // 修改了递归结束条件
return;
}
if (ValidSize() == k) // 将Sum()判断移到内部
{
if (Sum() == n) {
for (int t = 1; t <= k; t++)
{
printf("%d",result[t]);
}
printf("\n");
}
return;
}
for (int i = start; (k - ValidSize() < 9-i+1) && Sum() < n; i++)
{
result[++CurrentNum] = i;
CombineSum(k,n,i+1);
result[CurrentNum--] = 0;
}
}
int main()
{
int n,k;
memset(result,0,sizeof(result));
scanf("%d %d",&k,&n);
CombineSum(k,n,1);
system("pause");
return 0;
}
就是微调了几下,问题主要出在:
你的主要代码好像与题意关系都不太大。或者说冗余比较严重。