-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathCoinChange.java
92 lines (74 loc) · 2.41 KB
/
CoinChange.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/*
* https://www.techiedelight.com/coin-change-making-problem-unlimited-supply-coins/
*/
import java.util.Random;
class CoinChange {
private static void checkInput(int[] coins) {
if (coins == null) {
throw new IllegalArgumentException();
}
}
private static int recursiveInt(int[] coins, int changeValue) {
if (changeValue == 0) {
return 0;
}
if (changeValue < 0) {
return Integer.MAX_VALUE;
}
int minCoins = Integer.MAX_VALUE;
for (int i = 0; i < coins.length; ++i) {
int num = recursiveInt(coins, changeValue - coins[i]);
if (num != Integer.MAX_VALUE) {
minCoins = Math.min(minCoins, num + 1);
}
}
return minCoins;
}
public static int recursive(int[] coins, int changeValue) {
checkInput(coins);
return recursiveInt(coins, changeValue);
}
public static int bottomUp(int[] coins, int changeValue) {
checkInput(coins);
int[] T = new int[changeValue + 1];
for (int i = 1; i <= changeValue; ++i) {
T[i] = Integer.MAX_VALUE;
int minCoins = Integer.MAX_VALUE;
for (int j = 0; j < coins.length; ++j) {
if (i - coins[j] >= 0) {
minCoins = T[i - coins[j]];
}
if (minCoins != Integer.MAX_VALUE) {
T[i] = Math.min(T[i], minCoins + 1);
}
}
}
return T[changeValue];
}
}
class Driver {
private static int[] randomArray(int n, int max) {
int[] array = new int[n];
Random random = new Random();
for (int i = 0; i < n; ++i) {
array[i] = 1 + random.nextInt(max);
}
return array;
}
private static void printArray(int[] array) {
for (int a : array) {
System.out.print(a + " ");
}
System.out.println();
}
public static void main(String[] args) {
int max = 9;
int n = 5;
int changeValue = 23;
int[] coins = Driver.randomArray(n, max);
Driver.printArray(coins);
System.out.println("Number of coins required using method: ");
System.out.println("Recursive: " + CoinChange.recursive(coins, changeValue));
System.out.println("bottom up: " + CoinChange.bottomUp(coins, changeValue));
}
}