完全背包
518. 零钱兑换 II
题目链接:https://leetcode.cn/problems/coin-change-ii/submissions/
代码:
class Solution {
public:
int change(int amount, vector<int>& coins) {
vector<int> dp(amount+1,0);
dp[0] = 1;
for(int i = 0; i < coins.size(); i++)
{
for(int j = coins[i]; j <= amount ; j++)
{
dp[j] += dp[j-coins[i]];
}
}
return dp[amount];
}
};
377. 组合总和 Ⅳ
题目链接:https://leetcode.cn/problems/combination-sum-iv/
代码: