forked from learning-zone/java-basics
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCoinChange.java
More file actions
77 lines (68 loc) · 1.7 KB
/
CoinChange.java
File metadata and controls
77 lines (68 loc) · 1.7 KB
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
package DynamicProgramming;
import java.util.Arrays;
public class CoinChange {
public static int coinChange(int[] coins, int amount) {
int n = coins.length;
int[][] dp = new int[n + 1][amount + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= amount; j++) {
if (j == 0) {
dp[i][j] = 0;
} else if (i == 0) {
dp[i][j] = -1;
} else {
if (coins[i - 1] > j) {
dp[i][j] = dp[i - 1][j];
} else {
int price = j;
int max = Integer.MIN_VALUE;
int count = 0;
while (price > 0) {
count++;
if (price >= coins[i - 1] && dp[i][price - coins[i - 1]] != -1) {
max = Math.max(max, count + dp[i][price - coins[i - 1]]);
}
price -= coins[i - 1];
}
if (max == Integer.MIN_VALUE) {
if (price == 0) {
if (dp[i - 1][j] == -1)
dp[i][j] = count;
else
dp[i][j] = Math.min(dp[i - 1][j], count);
} else {
dp[i][j] = dp[i - 1][j];
}
} else {
if (price == 0) {
if (dp[i - 1][j] == -1)
dp[i][j] = Math.min(max, count);
else
dp[i][j] = Math.min(dp[i - 1][j], Math.min(max, count));
} else {
if (dp[i - 1][j] == -1)
dp[i][j] = max;
else
dp[i][j] = Math.min(dp[i - 1][j], max);
}
}
}
}
}
}
// print(dp);
return dp[n][amount];
}
public static void print(int[][] dp) {
for (int i = 0; i < dp.length; i++) {
System.out.println(Arrays.toString(dp[i]));
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
// [186,419,83,408]
// 6249
int[] coins = {186,419,83,408};
System.out.println(coinChange(coins, 6249));
}
}