518. 零钱兑换 II

class Solution {
public:
    int change(int amount, vector<int>& coins) {
        int dp[5001]={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];
    }
};