LeetCode 174. Dungeon Game

原创 2016年11月01日 14:28:04

欢迎移步到我的个人博客

版权声明:本文为博主原创文章,转载请注明出处,谢谢!

原题要求

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];
    }
}

解法思路

虽然这道题标记的难度是hard,但是很明显这是一道动态规划的题目,而且是“表格”动态规划。这道题适合从结果往前推,不要问我为什么。

结束语

没啥说的。

101个Java比.NET好的理由(1~10) (译者:陈佳新)

101个Java比.NET好的理由(1~10) (译者:陈佳新)   101 Reasons Java is Better than .NET (1~10)   作者:John Lambert   译...
  • bruce
  • bruce
  • 2003-02-09 11:01:00
  • 1882

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

原题:The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dunge...
  • tbsjianjian
  • tbsjianjian
  • 2016-09-06 19:54:25
  • 294

[leetcode] 174. Dungeon Game 解题报告

题目链接:https://leetcode.com/problems/dungeon-game/ The demons had captured the princess (P) and impr...
  • qq508618087
  • qq508618087
  • 2016-05-13 07:55:07
  • 1354

[leetcode-174]Dungeon Game(java)

问题描述:问题描述分析:这道题第一眼看上去就是二维DP问题,但是我之前是从(0,0)到(row-1,col-1)的遍历过程,但是这样一来的话,就会在某一项出现问题,详见代码2;出现问题之后,我想那肯定...
  • zdavb
  • zdavb
  • 2015-09-08 09:13:49
  • 164

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

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

leetcode 174: Dungeon Game

Dungeon Game Total Accepted: 332 Total Submissions: 2130 The demons had captured the princ...
  • xudli
  • xudli
  • 2015-01-07 08:42:41
  • 2191

[LeetCode] 174. Dungeon Game

LeetCode
  • hiimdaosui
  • hiimdaosui
  • 2016-09-21 12:08:53
  • 121

[leetcode] 174. Dungeon Game

The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon...
  • TstsUgeg
  • TstsUgeg
  • 2015-11-18 14:41:03
  • 279

leetCode 174. Dungeon Game

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

Leetcode 174. Dungeon Game

题目: The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a d...
  • xclfafa
  • xclfafa
  • 2017-06-14 19:37:48
  • 132
收藏助手
不良信息举报
您举报文章:LeetCode 174. Dungeon Game
举报原因:
原因补充:

(最多只允许输入30个字)