Leetcode:174. Dungeon Game

URL

https://leetcode.com/problems/dungeon-game/description/

描述

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.
-2 (K) -3 3
-5 -10 1
10 30 -5 (P)

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.

解题思路

该题也是通过动态规划的思想来解决，但是需要逆向的思路。
dungeon[i][j] 是Knight在位置（i,j）变化的健康点，可能为正数或者负数，分别代表增加或者减少的数值。
dp[i][j]表示在位置（i,j）位置的需要的最少健康值，才能走下一步。
接着这个思路往下想，在位置终点（m,n）他不需要往下走了，则至少保持健康值>=1即可。
所以dp[m][n] = Max(1,1-dungeon[m,n]);
对于其他节点 dp[i][j] 可以走到dp[i+1][j]或者dp[i][j+1].
所以dp[i][j] = Min{
max{1,dp[i+1][j]-dungeon[i][j]},
max{1,dp[i][j+1]-dungeon[i][j]}}

代码

public int calculateMinimumHP(int[][] dungeon) {
        if(dungeon==null) return 0;
        int row = dungeon.length;
        int width = dungeon[0].length;
        int [][] dp = new int[row][width];
        for(int i=row-1;i>=0;i--){
            for(int j=width-1;j>=0;j--) {
                if(i==row-1&&j==width-1){
                    dp[i][j] = Math.max(1,1-dungeon[i][j]);
                }else if(i==row-1){
                    dp[i][j] = Math.max(1,dp[i][j+1]-dungeon[i][j]);
                }else if(j==width-1){
                    dp[i][j] = Math.max(1,dp[i+1][j]-dungeon[i][j]);
                }else{
                    dp[i][j] = Math.min(
                            Math.max(1,dp[i][j+1]-dungeon[i][j]),
                            Math.max(1,dp[i+1][j]-dungeon[i][j])
                        );
                }
            }
        }
        return dp[0][0];
    }