小黑白天去看了大熊猫，吃了美蛙鱼，动态规划初探结束，准备去跟女鬼见面啦的leetcode之旅：剑指 Offer II 098. 路径的数目&&剑指 Offer II 103. 最少的硬币数目-CSDN博客

本文链接：https://blog.csdn.net/qq_37418807/article/details/129263517

剑指 Offer II 098. 路径的数目

小黑代码（与题解相一致）

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        # 初始化动态规划数组
        dp = [[0] * n for _ in range(m)]
        for i in range(m):
            dp[i][0] = 1
        for i in range(n):
            dp[0][i] = 1
        # 开始动态规划
        for i in range(1, m):
            for j in range(1, n):
                dp[i][j] = dp[i-1][j] + dp[i][j-1]
        return dp[m-1][n-1]

在这里插入图片描述

剑指 Offer II 103. 最少的硬币数目

小黑代码

class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        # 初始化动态规划数组
        dp = [0] + [float('inf')] * amount
        # 开始动态规划
        start = min(coins)
        for i in range(start, amount+1):
            for coin in coins:
                if i - coin >= 0 and dp[i-coin] != -1:
                    if dp[i-coin]+1 < dp[i]:
                        dp[i] = dp[i-coin]+1

        return dp[amount] if dp[amount] != float('inf') else -1