LeetCode 174 Dungeon Game-动态规划dp问题

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.

骑士需要从左上角开始进入房间，每次向右或向下移动一步进入下一个房间，直到到达右下角的房间救出公主。每个房间可能由精灵把守，会造成骑士失血，用负数表示；可能为空，用0表示；也可能有魔法球，可以给骑士补血。从左上角第一个房间开始，直到进入右下角关押公主的房间，血量都不能<=0。求骑士可以有的最低的血量保证最后不死。

由于最终目标是骑士到达公主位置，因此在右下角必须满足HP剩余1.

从右下角位置开始倒推，每个位置需要同时满足两个条件：（1）该位置HP为1(保证不死)，（2）该位置的HP足够到达公主(使用动态规划)

	public int calculateMinimumHP(int[][] A) {
		int m = A.length, n = A[0].length;
		A[m - 1][n - 1] = Math.max(1, -A[m - 1][n - 1] + 1);
		for (int j = n - 2; j >= 0; j--)
			A[m - 1][j] = Math.max(1, -A[m - 1][j] + A[m - 1][j + 1]);
		for (int i = m - 2; i >= 0; i--)
			A[i][n - 1] = Math.max(1, -A[i][n - 1] + A[i + 1][n - 1]);
		for (int i = m - 2; i >= 0; i--)
			for (int j = n - 2; j >= 0; j--)
				A[i][j] = Math.max(1, -A[i][j] + Math.min(A[i + 1][j], A[i][j + 1]));
		return A[0][0];
	}