java 递归修改,java – 递归更改：如何修改算法以打印所有组合？

我有一个算法递归地以下列方式进行更改：

public static int makeChange(int amount, int currentCoin) {

//if amount = zero, we are at the bottom of a successful recursion

if (amount == 0){

//return 1 to add this successful solution

return 1;

//check to see if we went too far

}else if(amount < 0){

//don't count this try if we went too far

return 0;

//if we have exhausted our list of coin values

}else if(currentCoin < 0){

return 0;

}else{

int firstWay = makeChange(amount, currentCoin-1);

int secondWay = makeChange(amount - availableCoins[currentCoin], currentCoin);

return firstWay + secondWay;

}

}

但是,我想在成功返回时添加存储或打印每个组合的功能.我有点困难,围绕着如何做到这一点.原始算法非常简单,但现在我很沮丧.有什么建议么？

CB