原文:
Given an infinite number of quarters (25 cents), dimes (10 cents), nickels (5 cents) and pennies (1 cent), write code to calculate the number of ways of representing n cents.
译文:
我们有25分,10分,5分和1分的硬币无限个。写一个函数计算组成n分的方式有几种?
package chapter_8_Recursion;
/**
*
* 给无限个25分,10分,5分和一分的硬币,写函数计算出组成n分的方式有多少种。
*
*/
public class Question_8_7 {
public static int recurCount(int curSum, int coin, int value) {
int count = 0;
if(curSum <= value) {
if(curSum == value) {
return 1;
}
if(coin >= 25) {
count += recurCount(curSum + 25, 25, value);
}
if(coin >= 10) {
count += recurCount(curSum + 10, 10, value);
}
if(coin >= 5) {
count += recurCount(curSum + 5, 5, value);
}
if(coin >= 1){
count += recurCount(curSum + 1, 1, value);
}
}
return count;
}
public static void main(String args[]) {
int value = 6;
System.out.println(recurCount(0,25,value));
}
}