class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> dp(amount+1,amount+1);
dp[0] = 0;
for(int i = 0;i < dp.size();i++)
{
for(int coin : coins){
if(i-coin < 0) continue;
dp[i] = min(dp[i],1+dp[i-coin]);
}
}
return (dp[amount] == amount+1)? -1 : dp[amount];
}
};
零钱兑换
最新推荐文章于 2024-07-20 12:07:54 发布