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

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.

## 我的解法

public class DungeonGame {

public int calculateMinimumHP(int[][] dungeon) {
int[][] needBlood = new int[dungeon.length][dungeon[0].length];

int width = dungeon[0].length;
int height = dungeon.length;
if (dungeon.length == 1 && dungeon[0].length == 1) {
return 1 - dungeon[0][0] > 0 ? 1 - dungeon[0][0] : 1;
}

needBlood[height - 1][width - 1] = dungeon[height - 1][width - 1] > 0 ? 1
: 1 - dungeon[height - 1][width - 1];

for (int i = height - 2; i >= 0; i--) {
int temp = needBlood[i + 1][width - 1] - dungeon[i][width - 1];
if (temp > 0) {
needBlood[i][width - 1] = temp;
} else {
needBlood[i][width - 1] = 1;
}
}

for (int j = width - 2; j >= 0; j--) {
int temp = needBlood[height - 1][j + 1] - dungeon[height - 1][j];
if (temp > 0) {
needBlood[height - 1][j] = temp;
} else {
needBlood[height - 1][j] = 1;
}
}

for (int i = height - 2; i >= 0; i--) {
for (int j = width - 2; j >= 0; j--) {
int value1 = needBlood[i + 1][j] - dungeon[i][j];
if (value1 < 0) {
value1 = 1;
}
int value2 = needBlood[i][j + 1] - dungeon[i][j];
if (value2 < 0) {
value2 = 1;
}
needBlood[i][j] = Math.min(value1, value2);
}
}
return needBlood[0][0];
}
}


• 本文已收录于以下专栏：

## leetcode 174: Dungeon Game

Dungeon Game Total Accepted: 332 Total Submissions: 2130 The demons had captured the princ...
• xudli
• 2015年01月07日 08:42
• 2169

## Leetcode.174 Dungeon Game |算法解析——动态规划

• tbsjianjian
• 2016年09月06日 19:54
• 217

## [leetcode] 174. Dungeon Game 解题报告

• qq508618087
• 2016年05月13日 07:55
• 1231

## LeetCode 174. Dungeon Game（游戏）

• jmspan
• 2016年05月25日 01:35
• 388

## [LeetCode 174] Dungeon Game

The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon....
• sbitswc
• 2015年09月30日 13:59
• 548

## 【LeetCode】Dungeon Game 解题报告【Solution】

【题目】 The demons had captured the princess (P) and imprisoned her in the bottom-right corner of ...
• ljiabin
• 2015年01月11日 21:41
• 9022

## leetCode 174. Dungeon Game

1.题目 原题连接 2.算法 题目的意思是从左上角到右下角，用最少的数值，这道题用动态规划比较好做，我们从反面推，从右下角开始找用最少血的 最先初始化的是公主所在的房间的起始生命值，然...
• qq_15037067
• 2017年03月19日 19:45
• 135

## Leetcode 174. Dungeon Game

• xclfafa
• 2017年06月14日 19:37
• 124

## Leetcode 174. Dungeon Game

• u010370157
• 2017年07月10日 22:20
• 72

## [LeetCode] 174. Dungeon Game

LeetCode
• hiimdaosui
• 2016年09月21日 12:08
• 109

举报原因： 您举报文章：LeetCode 174. Dungeon Game 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)