class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> dp(amount+1,amount+1);
dp[0]=0;
for(int i=1;i<=amount;i++) {
for(auto c:coins) {
if(i>=c) dp[i]=min(dp[i],1+dp[i-c]);
}
}
if(dp[amount]>amount) return -1;
else return dp[amount];
}
};
Leetcode322(力扣322):零钱兑换
最新推荐文章于 2024-06-19 15:35:04 发布