目录
LeeCode 518. 零钱兑换 II
LeeCode 377. 组合总和 Ⅳ
LeeCode 518. 零钱兑换 II
动规五部曲:
1.确定dp数组及下标含义: dp[j]:凑成总金额j的货币组合数;
2.确定递推公式:dp[j] += dp[j - coins[i]];
3.dp数组如何初始化:dp[0] = 1;
4.确定遍历顺序:外层for循环遍历物品(钱币), 内层for遍历背包(金钱总额);
5.举例递推dp数组
代码:
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];
}
};
LeeCode 377. 组合总和 Ⅳ
动规五部曲:
1.确定dp数组及下标含义: dp[i]: 凑成目标正整数为i的排列个数;
2.确定递推公式:dp[i] += dp[i - nums[j]];
3.dp数组如何初始化:dp[0] = 1, dp[i] = 0;
4.确定遍历顺序:target(背包)外循环,nums(物品)内循环,内循环从前到后遍历;
5.举例递推dp数组
代码:
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];
}
};