g0101_0200.s0174_dungeon_game.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0101_0200.s0174_dungeon_game;
// #Hard #Array #Dynamic_Programming #Matrix
public class Solution {
public int calculateMinimumHP(int[][] dungeon) {
int m = dungeon.length;
int n = dungeon[0].length;
int[][] memo = new int[m][n];
return Math.max(1, 1 - traverse(dungeon, 0, 0, memo));
}
private int traverse(int[][] dungeon, int r, int c, int[][] memo) {
if (r == dungeon.length - 1 && c == dungeon[0].length - 1) {
return dungeon[r][c];
}
if (memo[r][c] != 0) {
return memo[r][c];
}
int res = Integer.MIN_VALUE;
if (r + 1 < dungeon.length) {
res = Math.max(res, traverse(dungeon, r + 1, c, memo));
}
if (c + 1 < dungeon[0].length) {
res = Math.max(res, traverse(dungeon, r, c + 1, memo));
}
res = Math.min(dungeon[r][c], res + dungeon[r][c]);
memo[r][c] = res;
return res;
}
}