Lintcode完全背包问题

完全背包问题

完全背包：枚举每件物品取0，1，2，3 … m / A[i] 件，dp[i][j] = max(dp[i - 1][j],dp[i - 1][j - k * A[i]] + k * V[i])

#背包问题III
class Solution:
    """
    @param A: an integer array
    @param V: an integer array
    @param m: An integer
    @return: an array
    """
    def backPackIII(self, A, V, m):
        # write your code here
        
        #倒序,把完全背包问题转化为01背包问题
        #AA = []
        #VV = []
        #n = 0
        #for i in range(len(A)):
        #    sum = m // A[i]
        #    n += sum
        #    for j in range(sum):
        #        AA.append(A[i])
        #        VV.append(V[i])
        #        
        #dp = [0 for _ in range(m + 1)]
        #for i in range(n):
        #    for j in range(m, AA[i]-1, -1):
        #        dp[j] = max(dp[j], dp[j - AA[i]] + VV[i])
        
        #return dp[m]
        
        #正序枚举，每件物品都有无限个，可用正序枚举来做
        #时间复杂度O（mn）空间复杂度O（m）
        #该方法最好
        #n = len(A)
        #dp = [0] * (m + 1)
        #for i in range(n):
        #    for j in range(A[i], m + 1):
        #        dp[j] = max(dp[j], dp[j - A[i]] + V[i])
        
        #return dp[m]
        
        #二维数组正序处理
        n = len(A)
        dp = [[0] * (m + 1) for _ in range(n + 1)]
        for i in range(1, n + 1):
            for j in range(1, m + 1):
                dp[i][j] = dp[i - 1][j]
                if j >= A[i - 1]:
                    dp[i][j] = max(dp[i][j], dp[i][j - A[i - 1]] + V[i - 1])
        
        return dp[n][m]

#背包问题X
class Solution:
    """
    @param n: the money you have
    @return: the minimum money you have to give
    """
    def backPackX(self, n):
        # write your code here
        prices = [150, 250, 350]
        p = len(prices)
        dp = [0] * (n + 1)
        for i in range(p):
            for j in range(prices[i], n + 1):
                dp[j] = max(dp[j], dp[j - prices[i]] + prices[i])
        
        return n - dp[n]

#背包问题IV
class Solution:
    """
    @param nums: an integer array and all positive numbers, no duplicates
    @param target: An integer
    @return: An integer
    """
    def backPackIV(self, nums, target):
        # write your code here
        n = len(nums)
        dp = [0] * (target + 1)
        dp[0] = 1
        
        for i in range(n):
            for j in range(nums[i], target + 1):
                dp[j] += dp[j - nums[i]]
        
        return dp[target]