题目链接:
https://leetcode.com/problems/coin-change-2/description/
题解:
完全背包
代码:
class Solution {
public:
int change(int amount, vector<int>& coins) {
int dp[5010];
memset(dp,0,sizeof(dp));
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];
}
};