/
CoinChange2.java
49 lines (41 loc) · 1.05 KB
/
CoinChange2.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
package com.algo.leetcode.june2020;
import java.util.Arrays;
/*
* Coin Change 2
*
* You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume that you have infinite number of each kind of coin.
Example 1:
Input: amount = 5, coins = [1, 2, 5]
Output: 4
Explanation: there are four ways to make up the amount:
5=5
5=2+2+1
5=2+1+1+1
5=1+1+1+1+1
Example 2:
Input: amount = 3, coins = [2]
Output: 0
Explanation: the amount of 3 cannot be made up just with coins of 2.
Example 3:
Input: amount = 10, coins = [10]
Output: 1
Note:
You can assume that
0 <= amount <= 5000
1 <= coin <= 5000
the number of coins is less than 500
the answer is guaranteed to fit into signed 32-bit integer
* */
public class CoinChange2 {
public int change(int amount, int[] coins) {
int dp[]=new int[amount+1];
Arrays.fill(dp, 0);
dp[0]=1;
for(int coin:coins) {
for (int i = coin; i <= amount; i++) {
dp[i]+=dp[i-coin];
}
}
return dp[amount];
}
}