代码随想录训练营第四十四天|完全背包、LeetCode518、377

纯完全背包

• 背包的遍历顺序必须是正序（因为可以反复放）
• 两个for循环嵌套顺序无所谓，谁先谁后都行（问几种方法的话还是有区别的）

int test(vector<int>& weight, vector<int>& value, int bagweight) {
	vector<int> dp(bagweight + 1, 0);
	//先遍历物品再遍历背包容量
	for (int i = 0; i < weight.size(); ++i) {
		//因为完全背包，同一物品可以反复放，所以是正序遍历
		for (int j = weight[0]; j <= bagweight; ++j) {
			dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
		}
	}
	return dp[bagweight];
}

int test(vector<int>& weight, vector<int>& value, int bagweight) {
	vector<int> dp(bagweight + 1, 0);
	//先遍历背包容量再遍历物品
	//因为完全背包，同一物品可以反复放，所以是正序遍历
	for (int j = weight[0]; j <= bagweight; ++j) {
		for (int i = 0; i < weight.size(); ++i) {
			if (j >= weight[i]) {
				dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
			}
		}
	}
	return dp[bagweight];
}

LeetCode 518零钱兑换II

题目链接：518.零钱兑换II

• 这里两个for的嵌套顺序不能更改
• 先物品再背包——组合数
• 先背包在物品——排列数

class Solution {
public:
	int change(int amount, vector<int>& coins) {
		vector<int> dp(amount + 1, 0);//凑出总金额为j的方式有dp[j]种
		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];
	}
};

LetCode 377组合总和IV

题目链接：377.组合总和IV

class Solution {
public:
	int combinationSum4(vector<int>& nums, int target) {
		vector<int> dp(target + 1, 0);
		dp[0] = 1;
		//排列数的顺序，就不要按照二维数组的nums顺序来限制了，只要<=target的数都能用
		for (int j = 0; j <= target; ++j) {
			for (int i = 0; i < nums.size(); ++i) {
				if (j >= nums[i] && dp[j] < INT_MAX - dp[j - nums[i]]) dp[j] += dp[j - nums[i]];
			}
		}
		return dp[target];
	}
};