We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3e9d99b commit 04b6ac1Copy full SHA for 04b6ac1
JuneLeetCodingChallenge2020/Coin_Change_2.cpp
@@ -0,0 +1,25 @@
1
+//https://leetcode.com/explore/challenge/card/june-leetcoding-challenge/539/week-1-june-1st-june-7th/3353/
2
+
3
4
5
+class Solution {
6
+public:
7
+ int change(int amount, vector<int>& coins) {
8
+ vector<vector<int>> DP(amount + 1, vector<int>(coins.size() + 1, 0));
9
+ sort(coins.begin(), coins.end());
10
11
12
+ int i, j;
13
+ for(i = 0; i <= coins.size(); i++)
14
+ DP[0][i] = 1;
15
16
+ for(i = 1; i <= amount; i++) {
17
+ for(j = 1; j <= coins.size(); j++) {
18
+ if(i >= coins[j - 1])
19
+ DP[i][j] = DP[i - coins[j - 1]][j];
20
+ DP[i][j] += DP[i][j - 1];
21
+ }
22
23
+ return DP[amount][coins.size()];
24
25
+};
0 commit comments