假设山洞里共有a, b, c, d, e这5件宝物(不是5种宝物),它们的重量分别是2,2,6,5,4,它们的价值分别是6,3,5,4,6,现在给你个承重为10的背包, 怎么装背包,可以才能带走最多的财富。
#coding=utf-8
def package_max_value(arry_weight,arry_values,max_weight):
length_index=len(arry_weight)
matrix_max_values=[[0 for i in range(max_weight+1)] for i in range(length_index)]
for weight in range(max_weight+1):
if(weight>=arry_weight[0]):
matrix_max_values[0][weight]=arry_values[0]
else:
matrix_max_values[0][weight] = 0
for i in range(1,length_index):
for j in range(1,max_weight+1):
if(j-arry_weight[i]>=0):
matrix_max_values[i][j]=max(matrix_max_values[i-1][j],matrix_max_values[i-1][j-arry_weight[i]]+arry_values[i])
else:
matrix_max_values[i][j]=matrix_max_values[i-1][j]
return max(max(matrix_max_values))
arry_weight = [2,2,6,5,4]
arry_values = [6,3,5,4,6]
max_weight = 10
print(package_max_value(arry_weight,arry_values, max_weight))