LeetCode | Dungeon Game

question:

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)

explaination:

从尾部向头部遍历 移动到某一点时 对其右边点和下边点 进行判断比较,用各自的minValues减去当前点的dungeon值 并得到较小值为当前节点的minValues值(大于或等于1)

solution:

public int calculateMinimumHP(int[][] dungeon) {

    int m=dungeon.length;
    int n=dungeon[0].length;
    if(m<=0 || n<=0)
    {
        return 0;
    }

    int [][]minValues=new int[m][n];
    if(dungeon[m-1][n-1]<=0)
    {
        minValues[m-1][n-1]=Math.abs(dungeon[m-1][n-1])+1;
    }else{
        minValues[m-1][n-1]=1;
    }

    for(int i=m-2;i>=0;i--)
    {
        minValues[i][n-1]=Math.max(minValues[i+1][n-1]-dungeon[i][n-1],1);
    }

    for(int i=n-2;i>=0;i--)
    {
        minValues[m-1][i]=Math.max(minValues[m-1][i+1]-dungeon[m-1][i],1);
    }

    for(int i=m-2;i>=0;i--)
    {

        for(int j=n-2;j>=0;j--)
        {

            int tmp1=minValues[i+1][j]-dungeon[i][j];
            int tmp2=minValues[i][j+1]-dungeon[i][j];

            minValues[i][j]=Math.max(Math.min(tmp1,tmp2),1);



        }
    }


    return minValues[0][0];
}