322. Coin Change | LeetCode Solution
You are given an integer array coins
representing coins of different denominations and an integer amount
representing a total amount of money.
Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1
.
You may assume that you have an infinite number of each kind of coin.
Example 1:
Input: coins = [1,2,5], amount = 11 Output: 3 Explanation: 11 = 5 + 5 + 1
Example 2:
Input: coins = [2], amount = 3 Output: -1
Example 3:
Input: coins = [1], amount = 0 Output: 0
Constraints:
1 <= coins.length <= 12
1 <= coins[i] <= 231 - 1
0 <= amount <= 104
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int>dp(amount+1,INT_MAX-1);
dp[0]=0;
for(int i=1; i<=amount; i++){
for(int j=0; j<coins.size(); j++){
if(coins[j]==i){
dp[i]=1;
}
else if(dp[i]!=1){
if(i-coins[j]<0)continue;
else{
dp[i]=min(dp[i],1+dp[i-coins[j]]);
}
}
}
}
if(dp[amount]==INT_MAX-1)return -1;
return dp[amount];
}
};
0 Comments
If you have any doubts/suggestion/any query or want to improve this article, you can comment down below and let me know. Will reply to you soon.