完全背包● 518. 零钱兑换 II ● 377. 组合总和 Ⅳ

完全背包

518. 零钱兑换 II 

class Solution {
public:
    int change(int amount, vector& coins) 
    {
        vectordp(amount+1,0);
        dp[0]=1;
        for(int i=0;i

 377. 组合总和 Ⅳ  

class Solution {
public:
    int combinationSum4(vector& nums, int target) 
    {
        vectordp(target+1,0);
        dp[0]=1;
        for(int j=0;j<=target;j++)
        {
            for(int i=0;i=0&&dp[j]