Aug 11, 2024 · Jul 10, 2024 · Jul 11, 2024 · Aug 11, 2024 · Aug 11, 2024 · Aug 11, 2024
diff --git a/problems/背包理论基础01背包-1.md b/problems/背包理论基础01背包-1.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -307,38 +307,6 @@ dp[i-1][j]和dp[i - 1][j - weight[i]] 都在dp[i][j]的左上角方向(包括

		主要就是自己没有动手推导一下dp数组的演变过程,如果推导明白了,代码写出来就算有问题,只要把dp数组打印出来,对比一下和自己推导的有什么差异,很快就可以发现问题了。

	```CPP
	void test_2_wei_bag_problem1() {
	vector<int> weight = {1, 3, 4};
	vector<int> value = {15, 20, 30};
	int bagweight = 4;

	// 二维数组
	vector<vector<int>> dp(weight.size(), vector<int>(bagweight + 1, 0));

	// 初始化
	for (int j = weight[0]; j <= bagweight; j++) {
	dp[0][j] = value[0];
	}

	// weight数组的大小就是物品个数
	for(int i = 1; i < weight.size(); i++) { // 遍历物品
	for(int j = 0; j <= bagweight; j++) { // 遍历背包容量
	if (j < weight[i]) dp[i][j] = dp[i - 1][j];
	else dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weight[i]] + value[i]);

	}
	}

	cout << dp[weight.size() - 1][bagweight] << endl;
	}

	int main() {
	test_2_wei_bag_problem1();
	}

	```

		本题力扣上没有原题,大家可以去[卡码网第46题](https://kamacoder.com/problempage.php?pid=1046)去练习,题意是一样的,代码如下:

		```CPP
Expand Down