我正在尝试Java硬币更改问题以枚举所有可能的更改集。Java递归硬币更改尝试
我的逻辑如下这样:
while n >= denom m {
array[]+= denom m
n-= denom m
}
list.add[array[]]
return coinChanger(++denom)
我的代码:
public List<Integer> makeChange(int change) {
int[] denominations;
denominations = new int[]{1, 5, 10, 25};
return changeMaker(change, denominations, 0);
}
public List<Integer> changeMaker(int change, int[] denominations, int index) {
List<Integer> resultsList = new ArrayList<Integer>();
int[] resultDenom;
resultDenom = new int[4];
if (change <= 1) {
return resultsList;
}
while (change >= denominations[index]) {
resultDenom[index] += denominations[index];
System.out.println("ResultsDenom: " + resultDenom[index]);
change -= denominations[index];
}
resultsList.add(resultDenom[index]);
for (int val : resultDenom) {
System.out.println(val);
}
if (change > denominations[index]) {
return changeMaker(change-=denominations[index], denominations, ++index);
}
return resultsList;
}
该输出仅1组的所有枚举:
OUTPUT:
27
0
0
0
RESULT CHANGE PERMUTATIONS LIST: [27]
个
问题:
我竭力要弄清楚如何移动到下一面额,一旦其中一人完成...我知道你应该移到面额数组中的下一个索引...但是那只是增加了下一枚硬币......我如何使它增加下一枚最大的硬币,然后递归地下降到下一枚硬币......一直穿过所有4枚硬币?
谢谢!
* 编辑 **
public List<Integer> makeChange(int change) {
int[] denominations;
denominations = new int[]{25, 10, 5, 1};
return changeMaker(change, denominations, 0);
}
public List<Integer> changeMaker(int change, int[] denominations, int index) {
List<Integer> resultsList = new ArrayList<Integer>();
int[] resultDenom;
resultDenom = new int[4];
if (change <= 1) {
return resultsList;
}
if (index > 3) {
return resultsList;
}
//if 27 >= 25
if (change >= denominations[index]) {
//[+25, 0, 0, 0]
resultDenom[index] += denominations[index];
//{ LIST } <--- [25, 0, 0, 0]
//List now contains { [25, 0, 0, 0], }, still need all other permutations
resultsList.add(resultDenom[index]);
//27 - 25,
return changeMaker(change-=denominations[index], denominations, ++index);
}
return resultsList;
}
所需的输出:列出清单...... 27美分:
LIST{ [1, 0, 0, 2], [0, 2, 1, 2], [0, 1, 3, 2]... etc}
是你的整个输出? System.out.println(“ResultsDenom:”+ resultDenom [index]);'? – noMAD 2013-05-10 19:41:41
如果你的输入是'27',并且你没有任何改变就使用了上面的代码,那么输出就不能成为你的输入。 – noMAD 2013-05-10 19:43:22
http://stackoverflow.com/search?q=coin+change ... – 2013-05-10 19:43:23