-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinChange.java
More file actions
61 lines (53 loc) · 1.53 KB
/
MinChange.java
File metadata and controls
61 lines (53 loc) · 1.53 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
package DynamicProgramming;
import java.util.*;
public class MinChange {
static int minChangeBruteForce(int amount, int[] coins) {
if (amount == 0)
return 0;
int minCoins = -1;
for (int i = 0; i < coins.length; i++) {
if (coins[i] <= amount) {
int r = minChangeBruteForce(amount - coins[i], coins);
if (r != -1) {
int numCoin = r + 1;
if (numCoin < minCoins || minCoins == -1) {
minCoins = numCoin;
}
}
}
}
return minCoins;
}
static int minChange(int amount, int[] coins, HashMap<Integer, Integer> memo) {
if (amount == 0)
return 0;
if (memo.containsKey(amount))
return memo.get(amount);
int minCoins = -1;
for (int i = 0; i < coins.length; i++) {
if (coins[i] <= amount) {
int r = minChange(amount - coins[i], coins, memo);
if (r != -1) {
int numCoin = r + 1;
if (numCoin < minCoins || minCoins == -1) {
minCoins = numCoin;
}
}
}
}
memo.put(amount, minCoins);
return minCoins;
}
public static void main(String[] args) {
int[] coins = { 1, 2, 3 };
int amount = 4;
// System.out.println(minChangeBruteForce(amount,coins));
HashMap<Integer, Integer> memo = new HashMap<>();
System.out.println(minChange(amount, coins, memo));
}
}
// Input: coins = [1,2,3], amount = 4
// Output: 2
// Explanation: The combinations are:
// (1,1,1,1), (1,1,2), (1,3), (2,2)
// The minimum coins needed is 2. (1,3) or (2,2)