代码随想录算法训练营第36天｜52. 携带研究材料、518.零钱兑换II、377. 组合总和 Ⅳ、57. 爬楼梯

如果求组合数就是外层for循环遍历物品，内层for遍历背包。
如果求排列数就是外层for遍历背包，内层for循环遍历物品。

52. 携带研究材料

卡码网 52. 携带研究材料
代码随想录

itemN, bagN = map(int, input().split(" "))
weight = []
value = []
for _ in range(itemN):
    weight_, value_ = map(int,input().split(" "))
    weight.append(weight_)
    value.append(value_)
def test_CompletePack(weight, value, bagN):
    dp = [0] * (bagN + 1)
    
    for i in range(len(weight)):
        for j in range(weight[i], bagN + 1):
            dp[j] = max(dp[j], dp[j - weight[i]] + value[i])
    return dp[bagN]

print(test_CompletePack(weight, value, bagN))

518.零钱兑换II

leetcode 518.零钱兑换II
代码随想录

class Solution:
    def change(self, amount: int, coins: List[int]) -> int:
        dp = [0] * (amount + 1)
        dp[0] = 1
        # 组合问题，外层物品，内层背包
        for i in range(len(coins)):
            for j in range(coins[i], amount + 1):
                dp[j] += dp[j - coins[i]]
        return dp[-1]

377. 组合总和 Ⅳ

leetcode 377. 组合总和 Ⅳ
代码随想录

class Solution:
    def combinationSum4(self, nums: List[int], target: int) -> int:
        dp = [0] * (target+1)
        dp[0] = 1
        # 排列问题，外层背包，内层物品
        for i in range(1, target+1):
            for j in nums:
                if i >= j:
                    dp[i] += dp[i-j]
        return dp[-1]

57. 爬楼梯

卡码网 57. 爬楼梯
代码随想录

n,m = map(int, input().split(" "))

dp = [0] * (n+1)
dp[0] = 1

for i in range(1,n+1):
    for j in range(1,m+1):
        if i >= j:
            dp[i] += dp[i - j]
print(dp[-1])