Lintcode多重背包问题

最新推荐文章于 2024-08-29 12:01:12 发布

yeah_panda

最新推荐文章于 2024-08-29 12:01:12 发布

阅读量225

点赞数

分类专栏： Leetcode 文章标签：动态规划 leetcode

本文链接：https://blog.youkuaiyun.com/weixin_39504758/article/details/107821340

版权

Leetcode 专栏收录该内容

25 篇文章

订阅专栏

本文深入探讨了多重背包问题，一种经典的计算机科学与算法问题。通过详细的代码解析，展示了如何使用动态规划解决该问题，以求得在有限预算下获得最大价值的物品组合策略。

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

多重背包问题

#背包问题VII
class Solution:
    """
    @param n: the money of you
    @param prices: the price of rice[i]
    @param weight: the weight of rice[i]
    @param amounts: the amount of rice[i]
    @return: the maximum weight
    """
    def backPackVII(self, n, prices, weight, amounts):
        # write your code here
        
        #nums = 0
        #pp = []
        #ww = []
        #for i in range(len(prices)):
        #    sums = min(amounts[i], n // prices[i])
        #    nums += sums
        #    for j in range(sums):
        #        pp.append(prices[i])
        #        ww.append(weight[i])
        
        #dp = [0] * (n + 1)
        #for i in range(nums):
        #    for j in range(n, pp[i]-1, -1):
        #        dp[j] = max(dp[j], dp[j - pp[i]] + ww[i])
        
        #return dp[n]
        
        
        #
        p = len(prices)
        dp = [0] * (n + 1)
        
        for i in range(p):
            for _ in range(amounts[i]):
                for j in range(n, prices[i] - 1, -1):
                    dp[j] = max(dp[j], dp[j - prices[i]] + weight[i])
        
        return dp[n]