题目描述
有n个重量和价值分别为w i ,v i 的物品。从这些物品中挑选出总重不超过W的物品,求所有挑选方案中价值总和的最大值。
1、01背包
对于01背包问题,即每个物品有两种选择(选,不选)。
class Solution:
def zeronebag(self, n, W, w, v):
dp = [[0] * (W+1) for _ in range(n+1)]
for i in range(n-1, -1, -1):
for j in range(W+1):
if j < w[i]:
dp[i][j] = dp[i+1][j]
else:
dp[i][j] = max(dp[i+1][j], dp[i+1][j-w[i]]+v[i])
return dp[0][W]
if __name__=='__main__':
a = Solution().zeronebag(8, 50, [8, 18, 15, 20, 12, 10, 29, 44], [10, 40, 30, 50, 35, 40, 75, 130])
print(a)
2、完全背包
完全背包问题是不限制每个物品挑选的数量。
class Solution:
def fullbag(self, n, W, w, v):
dp = [0] * (W+1)
for i in range(n):
for j in range(w[i], W+1):
dp[j] = max(dp[j], dp[j-w[i]]+v[i])
return dp[W]
if __name__=='__main__':
a = Solution().fullbag(8, 50, [8, 18, 15, 20, 12, 10, 29, 44], [10, 40, 30, 50, 35, 40, 75, 130])
print(a)