[LeetCode]Dungeon Game

题目描述如下：

he 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.

解题思路：拿到这个题目之后，首先想到的就是使用动态规划的思想来解决，从最后一个点p出发，依次计算上以及左边点的值的情况。但是需要考虑两种情况，第一，边界边只能向下或者向右移动，只有一个方向，因此，首先计算他们应该的能力值，例如result[i][n-1]=Math.max(-dungeon[i][n-1]+result[i+1][n-1],1);。第二，对于非边界边，再使用动态规划的思想，min=Math.min(result[i+1][j],result[i][j+1]); result[i][j]=Math.max(-dungeon[i][j]+min,1);

代码实现如下：

public int calculateMinimumHP(int[][] dungeon) {
          int m = dungeon.length;
        int n = dungeon[0].length;
        if (m == 0) return 0;
        int[][] result = new int[m][n];
        int min=0;
        result[m-1][n-1]=Math.max(-dungeon[m-1][n-1]+1,1);
        for(int i=m-2;i>=0;i--){//the most left edge
            result[i][n-1]=Math.max(-dungeon[i][n-1]+result[i+1][n-1],1);
        }
        for(int j=n-2;j>=0;j--){//the most down edge
            result[m-1][j]=Math.max(-dungeon[m-1][j]+result[m-1][j+1],1);
        }
        for(int i=m-2;i>=0;i--){// the other edges
            for(int j=n-2;j>=0;j--){
               min=Math.min(result[i+1][j],result[i][j+1]);
                result[i][j]=Math.max(-dungeon[i][j]+min,1);
            }
        }
        return result[0][0];
    }