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];
}
};
class Solution {
public:
int combinationSum4(vector<int>& nums, int target) {
vector<int> dp(target+1,0);
dp[0]=1;
for(int i=1;i<=target;i++)
{
for(int j=0;j<nums.size();j++)
{
if(i>=nums[j]&&dp[i] < INT_MAX - dp[i - nums[j]])
dp[i]+=dp[i-nums[j]];
}
}
return dp[target];
}
};