LeetCode 174. Dungeon Game

欢迎移步到我的个人博客

版权声明：本文为博主原创文章，转载请注明出处，谢谢!

原题要求

The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially positioned in the top-left room and must fight his way through the dungeon to rescue the princess.

The knight has an initial health point represented by a positive integer. If at any point his health point drops to 0 or below, he dies immediately.

Some of the rooms are guarded by demons, so the knight loses health (negative integers) upon entering these rooms; other rooms are either empty (0’s) or contain magic orbs that increase the knight’s health (positive integers).

In order to reach the princess as quickly as possible, the knight decides to move only rightward or downward in each step.

Write a function to determine the knight’s minimum initial health so that he is able to rescue the princess.

For example, given the dungeon below, the initial health of the knight must be at least 7 if he follows the optimal path RIGHT-> RIGHT -> DOWN -> DOWN.

Notes:

The knight’s health has no upper bound.
Any room can contain threats or power-ups, even the first room the knight enters and the bottom-right room where the princess is imprisoned.

我的解法

public class DungeonGame {    public int calculateMinimumHP(int[][] dungeon) {        int[][] needBlood = new int[dungeon.length][dungeon[0].length];        int width = dungeon[0].length;        int height = dungeon.length;        if (dungeon.length == 1 && dungeon[0].length == 1) {            return 1 - dungeon[0][0] > 0 ? 1 - dungeon[0][0] : 1;        }        needBlood[height - 1][width - 1] = dungeon[height - 1][width - 1] > 0 ? 1                : 1 - dungeon[height - 1][width - 1];        for (int i = height - 2; i >= 0; i--) {            int temp = needBlood[i + 1][width - 1] - dungeon[i][width - 1];            if (temp > 0) {                needBlood[i][width - 1] = temp;            } else {                needBlood[i][width - 1] = 1;            }        }        for (int j = width - 2; j >= 0; j--) {            int temp = needBlood[height - 1][j + 1] - dungeon[height - 1][j];            if (temp > 0) {                needBlood[height - 1][j] = temp;            } else {                needBlood[height - 1][j] = 1;            }        }        for (int i = height - 2; i >= 0; i--) {            for (int j = width - 2; j >= 0; j--) {                int value1 = needBlood[i + 1][j] - dungeon[i][j];                if (value1 < 0) {                    value1 = 1;                }                int value2 = needBlood[i][j + 1] - dungeon[i][j];                if (value2 < 0) {                    value2 = 1;                }                needBlood[i][j] = Math.min(value1, value2);            }        }        return needBlood[0][0];    }}

解法思路

虽然这道题标记的难度是hard，但是很明显这是一道动态规划的题目，而且是“表格”动态规划。这道题适合从结果往前推，不要问我为什么。

结束语

没啥说的。