Python背包问题动态规划算法

WilliamHuangSt

于 2019-11-10 00:41:29 发布

阅读量655

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 编程计算机文章标签：算法背包问题动态规划 python

The article is written by William Huang,Thanks for your reading.

本文链接：https://blog.youkuaiyun.com/stephen29/article/details/102993779

本文详细介绍了如何使用Python编程实现动态规划算法来解决经典的背包问题。通过实例解析，展示了如何构造状态转移方程，逐步求解最优解，帮助读者深入理解动态规划在解决此类问题中的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import numpy as np
# 背包问题


# 第一阶段：递归式求解


def package(capacity, index, weightList, valueList):
    if capacity <= 0 or index < 0:
        return 0
    else:
        if weightList[index] <= capacity:
            return max(package(capacity, index - 1, weightList, valueList), valueList[index] + package(capacity - weightList[index], index - 1, weightList, valueList))
        else:
            return package(capacity, index - 1, weightList, valueList)


def findPackage1(capacity, weightList, valueList):
    length = len(weightList)
    if (length == 0):
        return 0
    return package(capacity, length - 1, weightList, valueList)


# 第二阶段：含记忆式搜索的递归式求解


def package2(capacity, index, weightList