Mar 27, 2023 · Mar 24, 2023 · Mar 27, 2023 · Mar 27, 2023 · Mar 27, 2023 · Mar 27, 2023
diff --git a/Templates/10.Dynamic-Programming/Pack-CompletePack.py b/Templates/10.Dynamic-Programming/Pack-CompletePack.py
Original file line number	Diff line number	Diff line change
Expand Up		@@ -8,7 +8,7 @@ def completePackMethod1(self, weight: [int], value: [int], W: int):
		for i in range(1, size + 1):
		# 枚举背包装载重量
		for w in range(W + 1):
	# 枚举第 i 种物品能取个数
	# 枚举第 i - 1 种物品能取个数
		for k in range(w // weight[i - 1] + 1):
		# dp[i][w] 取所有 dp[i - 1][w - k * weight[i - 1] + k * value[i - 1] 中最大值
		dp[i][w] = max(dp[i][w], dp[i - 1][w - k * weight[i - 1]] + k * value[i - 1])
Expand Down