-
Notifications
You must be signed in to change notification settings - Fork 0
/
coin change 2.txt
63 lines (43 loc) · 1.45 KB
/
coin change 2.txt
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
518. Coin Change 2
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.
Return the number of combinations that make up that amount. If that amount of money cannot be made up by any combination of the coins, return 0.
You may assume that you have an infinite number of each kind of coin.
The answer is guaranteed to fit into a signed 32-bit integer.
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
Constraints:
1 <= coins.length <= 300
1 <= coins[i] <= 5000
All the values of coins are unique.
0 <= amount <= 5000
solution----
// this is an example of 1 d dp
class Solution
{// this question is about maximization
public int change(int amount, int[] coins)
{// amount-coin
int[] ch=new int[amount+1];
ch[0]=1;//first element of the array is 1.
for(int coin:coins)
{
for(int i=coin;i<amount+1;i++)
{// here in this question the inner loop is loop is running for amount
ch[i]+=ch[i-coin];
}
}
return ch[amount];
}
}