518.零钱兑换II
C++:
class Solution {
public:
int change(int amount, vector<int>& coins) {
int n=coins.size();
vector<int>dp(amount+1,0);
dp[0]=1;
for(int i=0;i<n;i++){
for(int j=coins[i];j<=amount;j++)
dp[j]+=dp[j-coins[i]];
}
return dp[amount];
}
};
C#:
public class Solution {
public int Change(int amount, int[] coins) {
/*int sum=0;
for(int i=0;i<coins.Length;i++){
sum+=coins[i];
}
if(amount>sum) return 0;*/
int[] dp=new int [amount+1];
dp[0]=1;
for(int i=0;i<coins.Length;i++){//wu
for(int j=coins[i];j<=amount;j++){//bao
dp[j]+=dp[j-coins[i]];
}
}
return dp[amount];
}
}
377. 组合总和 Ⅳ
C++:C++测试用例有两个数相加超过int的数据,所以需要在if里加上dp[i] < INT_MAX - dp[i - num]。
class Solution {
public:
int combinationSum4(vector<int>& nums, int target) {
vector<int> dp(target + 1, 0);
dp[0] = 1;
for (int i = 0; i <= target; i++) { // 遍历背包
for (int j = 0; j < nums.size(); j++) { // 遍历物品
if (i - nums[j] >= 0 && dp[i] < INT_MAX - dp[i - nums[j]]) {
dp[i] += dp[i - nums[j]];
}
}
}
return dp[target];
}
};
C#:
public class Solution {
public int CombinationSum4(int[] nums, int target) {
int []dp=new int[target+1];
dp[0]=1;
for(int j=0;j<=target;j++){//bao
for(int i=0;i<nums.Length;i++){//wu
if(j-nums[i]>=0)
dp[j]+=dp[j-nums[i]];
}
}
return dp[target];
}
}