LeetCode 174. Dungeon Game（动态规划）

题目来源：https://leetcode.com/problems/dungeon-game/

问题描述

174. Dungeon Game

Hard

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)

 

Note:

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

------------------------------------------------------------

题意

给定一个迷宫，迷宫的每个单元格有加血或者减血的buff，骑士从左上角开始，只能向下或向右移动，要解救右下角的公主，在每个单元格（包括开始位置和结束位置）骑士的血量要大于等于1，求骑士的最少初始血量

------------------------------------------------------------

思路

很容易想到是动态规划，但是不能从左上角到右下角计算，要从右下角到左上角计算，动态规划数组dp[i][j]表示从位置(i, j)出发能够解救公主的最低血量。可以使用状态压缩将二维动态规划数组压缩为一维。

------------------------------------------------------------

代码

class Solution {
    public int calculateMinimumHP(int[][] dungeon) {
        int m = dungeon.length;
        if (m == 0) {
            return 0;
        }
        int n = dungeon[0].length;
        if (n == 0) {
            return 0;
        }
        int[] need = new int[n]; // need[i][j]: min health to reach princess from point(i, j)
        need[n-1] = dungeon[m-1][n-1] >= 1? 1: 1 - dungeon[m-1][n-1];
        for (int j=n-2; j>=0; --j) {
            need[j] = need[j+1] - dungeon[m-1][j] <= 1? 1: need[j+1] - dungeon[m-1][j];
        }
        for (int i=m-2; i>=0; --i) {
            need[n-1] = need[n-1] - dungeon[i][n-1] <= 1? 1: need[n-1] - dungeon[i][n-1];
            for (int j=n-2; j>=0; --j) {
                need[j] = Math.min(need[j], need[j+1]) - dungeon[i][j] <= 1? 1: Math.min(need[j], need[j+1]) - dungeon[i][j]; 
            }
        }
        return need[0];
    }
}