322. 零钱兑换
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> dp(amount+1,INT_MAX);
dp[0] = 0;
for(int i=0;i<coins.size();i++){
for(int j=1;j<dp.size();j++){
if(j>=coins[i]&&dp[j-coins[i]]!=INT_MAX){
dp[j] = min(dp[j],dp[j-coins[i]]+1);
}
}
}
if(dp[amount]==INT_MAX) return -1;
return dp[amount];
}
};
279.完全平方数
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n+1,INT_MAX);
dp[0] = 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(j>=i*i&&dp[j-i*i]!=INT_MAX){
dp[j] = min(dp[j],dp[j-i*i]+1);
}
}
}
return dp[n];
}
};