代码随想录算法训练营Day46|贪心算法6
一、518.零钱兑换II
class Solution {
public int change(int amount, int[] coins) {
int dp[][]=new int[coins.length][amount+1];
for(int i=0;i<=amount;i+=coins[0]){
dp[0][i]=1;
}
for(int i=1;i<coins.length;i++){
for(int j=0;j<=amount;j++){
for(int x=0;x*coins[i]<=j;x++){
dp[i][j]+=dp[i-1][j-x*coins[i]];
}
}
}
return dp[coins.length-1][amount];
}
}
二、377. 组合总和 Ⅳ
class Solution {
public int combinationSum4(int[] nums, int target) {
int[] dp = new int[target + 1];
dp[0] = 1;
for (int i = 0; i <= target; i++) {
for (int j = 0; j < nums.length; j++) {
if (i >= nums[j]) {
dp[i] += dp[i - nums[j]];
}
}
}
return dp[target];
}
}