(int amount, int[] denoms, int index)
| 4 | |
| 5 | public class Question { |
| 6 | public static int makeChange(int amount, int[] denoms, int index) { |
| 7 | if (index >= denoms.length - 1) return 1; // one denom remaining -> one way to do it |
| 8 | int denomAmount = denoms[index]; |
| 9 | int ways = 0; |
| 10 | for (int i = 0; i * denomAmount <= amount; i++) { |
| 11 | int amountRemaining = amount - i * denomAmount; |
| 12 | ways += makeChange(amountRemaining, denoms, index + 1); // go to next denom |
| 13 | } |
| 14 | return ways; |
| 15 | } |
| 16 | |
| 17 | public static int makeChange1(int n) { |
| 18 | int[] denoms = {25, 10, 5, 1}; |
no test coverage detected