0-1,完全，背包问题精简python实现

最新推荐文章于 2024-07-13 11:30:42 发布

jade07

最新推荐文章于 2024-07-13 11:30:42 发布

阅读量682

点赞数 1

分类专栏：算法基础知识

本文链接：https://blog.csdn.net/jade07/article/details/88737979

版权

算法同时被 2 个专栏收录

13 篇文章 0 订阅

订阅专栏

基础知识

8 篇文章 0 订阅

订阅专栏

# 物品的重量和价值
weights = [5, 4, 7, 2, 6]
values = [12, 3, 10, 3, 6]
# 背包容量
Capacity = 15

# 0&1背包方案
res = [0]*16
for i in range(len(weights)):
    for j in range(len(res)-1, -1, -1):
        if j >= weights[i]:
            res[j] = max(res[j], max(res[j - 1], res[j - weights[i]] + values[i]))

print(res)
# 完全背包方案
res = [0]*16
for c in range(0, Capacity+1):
    for i, weight in enumerate(weights):
        if c >= weight:
            res[c] = max(res[c], max(res[c-1], (res[c - weight] + values[i])))
print(res)

# 多重背包问题
Capacity = 9
weights = [2, 4]
values = [100, 300]
counts = [4, 1]
res = [0] * (Capacity+1)
for i in range(len(weights)):   # 物品种类
    for c in range(counts[i]):  # 物品个数
        for j in range(len(res)-1, -1, -1):  # 包空间
            if j >= weights[i]:
                res[j] = max(res[j], max(res[j - 1], res[j - weights[i]] + values[i]))
print(res)