每日一道Leetcode - 174. 地下城游戏 [反向动态规划｜路径]

最新推荐文章于 2025-02-18 18:19:36 发布

奋进的杰西

最新推荐文章于 2025-02-18 18:19:36 发布

阅读量106

点赞数

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/weixin_41041275/article/details/119354813

版权

Leetcode 专栏收录该内容

304 篇文章

订阅专栏

在这里插入图片描述

class Solution:
    def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:
        m = len(dungeon)
        n = len(dungeon[0])
        dp = [[0]* n for _ in range(m)]

        for i in range(m-1,-1,-1):
            for j in range(n-1,-1,-1):
                if i == m-1 and j == n-1:
                    dp[i][j] = max(0,-dungeon[i][j])
                elif j == n-1:
                    need = dp[i+1][j] - dungeon[i][j]
                    dp[i][j] = max(0,need)
                elif i == m-1:
                    need = dp[i][j+1] - dungeon[i][j]
                    dp[i][j] = max(0,need)
                else:
                    need = min(dp[i+1][j],dp[i][j+1])-dungeon[i][j]
                    dp[i][j] = max(0,need)
        return dp[0][0] + 1