这篇博文与“一个无重复面值的找零算法的思路与实现(一)”是姊妹篇。解法是基于“找零钱递归实现”,代码和基本相同,唯一不同的地方是第26行代码。
代码如下:
#include <iostream>
#include <string.h>
using namespace std;
//20块钱找零,零钱由1、2、5、10四种币值
#define MAX_VALUE 17
int array[] = {1,2,5,10,MAX_VALUE};
int next[MAX_VALUE] = {0};
void SegNum(int nSum, int* pData, int nDepth)
{
if(nSum < 0)
return;
if(nSum == 0)
{
for(int j = 0; j < nDepth; j++)
cout << pData[j] << " ";
cout << endl;
return;
}
int i = (nDepth == 0 ? next[0] : pData[nDepth-1]);
i = (nDepth == 0 ? next[0] : next[i]);
for(; i <= nSum;)
{
pData[nDepth++] = i;
SegNum(nSum-i,pData,nDepth);
nDepth--;
i = next[i];
}
}
void ShowResult(int array[],int nLen)
{
next[0] = array[0];
int i = 0;
for(; i < nLen-1; i++)
next[array[i]] = array[i+1];
next[array[i]] = array[i]+1;
int* pData = new int [MAX_VALUE];
SegNum(MAX_VALUE,pData,0);
delete [] pData;
}
int main()
{
//找零钱测试
ShowResult(array,sizeof(array)/sizeof(int));
int x;
cin>>x;
return 0;
}