leetcode 174: Dungeon Game

最新推荐文章于 2022-11-27 13:55:09 发布

mikefan1991

最新推荐文章于 2022-11-27 13:55:09 发布

阅读量191

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/mikefan1991/article/details/47949191

版权

leetcode 专栏收录该内容

201 篇文章 0 订阅

订阅专栏

Use DP, but the trick here is to go from the Queen to the Knight. dp[i][j] means the minimum health needed at position dungeon[i][j]. I tried to loop from the Knight to the Queen, but the code will be very long and cannot handle all test cases.

class Solution {
public:
    int calculateMinimumHP(vector<vector<int>>& dungeon) {
        int m=dungeon.size();
        int n=dungeon[0].size();
        vector<int > a(n);
        vector<vector<int> > dp(m,a);
        for(int i=m-1;i>=0;i--)
            for(int j=n-1;j>=0;j--)
            {
                if(i==m-1&&j==n-1)
                    dp[i][j]=dungeon[i][j]<0?1-dungeon[i][j]:1;
                else if(i==m-1)
                    dp[i][j]=max(1,dp[i][j+1]-dungeon[i][j]);
                else if(j==n-1)
                    dp[i][j]=max(1,dp[i+1][j]-dungeon[i][j]);
                else
                    dp[i][j]=max(1,min(dp[i+1][j],dp[i][j+1])-dungeon[i][j]);
            }
        return dp[0][0];
    }
};