python 0-1背包问题（回溯法）

最新推荐文章于 2024-05-15 18:52:52 发布

yue_luo_

最新推荐文章于 2024-05-15 18:52:52 发布

阅读量3.8k

点赞数 2

CC 4.0 BY-SA版权

分类专栏： Python

本文链接：https://blog.csdn.net/yue_luo_/article/details/95097844

Python 专栏收录该内容

16 篇文章

订阅专栏

在这里插入图片描述
代码

bestV = 0 # 最大价值
currW = 0 # 当前背包重量
currV = 0 # 当前背包价值
bestx = None # 最优解路径
def backtrack(i):
    global bestV,bestx,currV,currW,x
    if i>= n:
        if bestV<currV:
            bestV = currV
            bestx = x[:]
    else:
        if currW+w[i]<=c:
            x[i]=1
            currW += w[i]
            currV += v[i]
            backtrack(i+1)
            currW -= w[i]
            currV -= v[i]
        x[i]=0
        backtrack(i+1)
if __name__=='__main__':
	n=6
	c=10
	w = [2, 2, 3, 1, 5, 2]
	v = [2, 3, 1, 5, 4, 3]
	x = [0 for i in range(n)]
    backtrack(0)
    print(bestV) #最大价值
    print([i+1  for i in range(n) if bestx[i]]) #最优解路径
    ## 输出
    # 15
	# [2, 4, 5, 6]

参考链接

https://www.cnblogs.com/xym4869/p/8513801.html
http://blog.csdn.net/littlethunder/article/details/26621427