提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档
前言
一、力扣518. 零钱兑换 II
class Solution {
public int change(int amount, int[] coins) {
int[] dp = new int[amount + 1];
dp[0] = 1;
for(int i = 0; i < coins.length; i ++){
for(int j = coins[i]; j <= amount; j ++){
dp[j] += dp[j - coins[i]];
}
}
return dp[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] >= 0){
dp[i] += dp[i - nums[j]];
}
}
}
return dp[target];
}
}