class Solution {
public:
int calculateMinimumHP(vector<vector<int>>& dungeon) {
int N = dungeon.size();
if(N == 0 ) return 0;
int M = dungeon[0].size();
int dp[N][M];
for(int i=N-1;i>=0;i--){
for(int j=M-1;j>=0;j--){
if(i == N-1){
if(j == M-1) dp[i][j] = max(1,1-dungeon[i][j]);
else dp[i][j] = max(1,dp[i][j+1]-dungeon[i][j]);
}else{
if(j==M-1) dp[i][j] = max(1,dp[i+1][j]-dungeon[i][j]);
else{
dp[i][j] = max(1,dp[i+1][j]-dungeon[i][j]);
dp[i][j] = min(dp[i][j],max(1,dp[i][j+1]-dungeon[i][j]));
}
}
}
}
return dp[0][0];
}
};
No.107 - LeetCode107 - 矩阵迷宫生命值不能低于1 - 反向dp
最新推荐文章于 2021-11-01 21:22:25 发布