题目
思路
01背包一维数组
顺序遍历物品i(for循环第一层),
倒序遍历背包容量j(for循环第二层),且weight[i] < j < 背包最大容量
一维递推数组:dp[j] = max(dp[j], dp[j - weight[i]] + value[i])
01背包二维数组
物品和背包容量的遍历顺序无影响。
二维递推数组:dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weight[i]] + value[i])
代码
代码1:二维DP数组
dp = [[0]*(N+1) for _ in range(M)] # 数组初始化为0
for j in range(weight[0], N+1): # 第一行初始化
dp[0][j] = value[0]
for i in range(1, M):
for j in range(0, N+1):
if j<weight[i]: # 如果背包装不下第i个物品
dp[i][j] = dp[i-1][j]
else:
dp[i][j] = max(dp[i-1][j-weight[i]]+value[i], dp[i-1][j])
print(dp[M-1][N])
代码2:一维DP数组
row1 = input().split(' ')
M = int(row1[0])
N = int(row1[1])
weight = [int(i) for i in input().split(' ')]
value = [int(i) for i in input().split(' ')]
dp = [0]*(N+1) # 初始化为0即可
for i in range(M):
for j in range(N, weight[i]-1, -1): # 注意要倒序
dp[j] = max(dp[j], dp[j-weight[i]]+value[i])
print(dp[N])
'''
输入:
6 1
2 2 3 1 5 2
2 3 1 5 4 3
输出:
5
'''