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.

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

tags: dp(动态规划)

刚开始，一直想着从K到P进行dp，构建二维数组arr，arr[i][j]点的值表示从K到(i,j)点，骑士需要的minimum initial health。很复杂，而且结果也不对。

后来，看别人都是从P到K进行dp，如此的简单。建立二维数组hp。hp[i][j]表示从(i,j)点到P点，骑士需要的minimum initial health。

       hp[i][j] = min( hp[i+1][j], hp[i][j+1] ) - hp[i][j]; 且：hp[i][j] = hp[i][j]<=0 ? 1 : hp[i][j];    

代码：

class Solution {//O(M*N) time, O(M*N) memory
public:
    int calculateMinimumHP(vector<vector<int> > &dungeon) {
        int M = dungeon.size();
        int N = dungeon[0].size();
        vector<vector<int> > hp(M + 1, vector<int>(N + 1, INT_MAX));
        hp[M][N - 1] = 1;
        hp[M - 1][N] = 1;
        for (int i = M - 1; i >= 0; i--) {
            for (int j = N - 1; j >= 0; j--) {
                int need = min(hp[i + 1][j], hp[i][j + 1]) - dungeon[i][j];
                hp[i][j] = need <= 0 ? 1 : need;
            }
        }
        return hp[0][0];
    }
};

class Solution {//O(M*N) time, O(1) memory
public:
    int calculateMinimumHP(vector<vector<int> > &dungeon) {
        int M = dungeon.size();
        int N = dungeon[0].size();
        for (int i = M - 1; i >= 0; i--) {
            for (int j = N - 1; j >= 0; j--) {
                if(i==M-1&&j==N-1) dungeon[M-1][N-1] = 1 - dungeon[M-1][N-1];
                else if(i==M-1) dungeon[i][j] = dungeon[i][j+1] - dungeon[i][j];
                else if(j==N-1) dungeon[i][j] = dungeon[i+1][j] - dungeon[i][j];
                else dungeon[i][j] = min(dungeon[i + 1][j], dungeon[i][j + 1]) - dungeon[i][j];
                dungeon[i][j] = dungeon[i][j] <= 0 ? 1 : dungeon[i][j];
            }
        }
        return dungeon[0][0];
    }
};