Leetcode完全/无限背包小结（Python）

原始完全背包问题
说明：输入输出样例

#二维DP
N, V = map(int, input().split())
dp = [[0 for i in range(V+1)] for j in range(N+1)]
for i in range(1, N+1):
    vi, wi = map(int, input().split())
    for j in range(1, V+1):
        dp[i][j] = dp[i-1][j]
        if j >= vi:
            dp[i][j] = max(dp[i-1][j], dp[i][j-vi]+wi)
print(dp[N][V])

#一维DP
N, V = map(int, input().split())
dp = [0 for i in range(V+1)]
for i in range(1, N+1):
    vi, wi = map(int, input().split())
    for j in range(1, V+1):
        if j >= vi:
            dp[j] = max(dp[j], dp[j-vi]+wi)
print(dp[V])

零钱兑换
题目地址

#二维DP
class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        #状态表示：dp[i][j]表示包括前i个硬币组合成的金额j所需的最少硬币个数
        #状态转移方程：dp[i][j] = min(dp[i-1][j], min(dp[i][j]+1))
        #初始化：dp[0][0]和dp[0][coins[0]]都为inf
        #输出dp[amount]
        if not coins and amount <= 0:return -1
        N = len(coins)
        dp = [[amount+1 for i in range(amount+1)] for j in range(N+1)]
        #初始化
        dp[0][0] = 0
        for i in range(len(dp)):
            dp[i][0] = 0
        for i in range(1, N+1):
            for j in range(1, amount+1):
                dp[i][j] = dp[i-1][j]
                if j >= coins[i-1]:
                    dp[i][j] = min(dp[i-1][j], dp[i][j-coins[i-1]]+1)
        return dp[-1][-1] if dp[-1][-1]!=amount+1 else -1
#一维DP
class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        #状态表示：dp[i]表示凑出金额i所需的最少硬币个数
        #状态转移方程：dp[i] = min(dp[i], dp[i-coin]+1)
        #初始化：dp[0]为inf
        #输出dp[amount]
        if not coins and amount <= 0:return -1
        N = len(coins)
        dp = [amount+1 for i in range(amount+1)]
        #初始化
        dp[0] = 0
        for i in range(1, N+1):
            for j in range(coins[i-1], amount+1):
                    dp[j] = min(dp[j], dp[j-coins[i-1]]+1)
        return dp[-1] if dp[-1]!=amount+1 else -1

class Solution:
    def change(self, amount: int, coins: List[int]) -> int:
        N = len(coins)
        dp = [[0 for i in range(amount+1)] for j in range(N+1)]
        dp[0][0] = 1
        for i in range(len(dp)):
            dp[i][0] = 1
        for i in range(1, N+1):
            for j in range(1, amount+1):
                dp[i][j] = dp[i-1][j]
                if j >= coins[i-1]:
                    dp[i][j] = dp[i-1][j] + (dp[i][j-coins[i-1]])
        return dp[-1][-1]

组合数
题目地址

#只能用一维dp，因为每个背包容量装的是当前状态下的所有可能
#状态表示：dp[i]，目标数为i的组合数个数
#状态转移：dp[i] = sum(dp[i-num])
#basecase：dp[0] = 1,表示如果那个硬币的面值刚刚好等于需要凑出的价值，这个就成为 1 种组合方案
class Solution:
    def combinationSum4(self, nums: List[int], target: int) -> int:
        N = len(nums)
        dp = [0] * (target+1)
        dp[0] = 1
        for i in range(1, target+1):
            for j in range(N):
                if i >= nums[j]:
                    dp[i] += dp[i-nums[j]]
        return dp[-1]