Package g0101_0200.s0174_dungeon_game

Class Solution

java.lang.Object

g0101_0200.s0174_dungeon_game.Solution

public class Solution
extends Object

174 - Dungeon Game.<p>Hard</p> <p>The demons had captured the princess and imprisoned her in <strong>the bottom-right corner</strong> of a <code>dungeon</code>. The <code>dungeon</code> consists of <code>m x n</code> rooms laid out in a 2D grid. Our valiant knight was initially positioned in <strong>the top-left room</strong> and must fight his way through <code>dungeon</code> to rescue the princess.</p> <p>The knight has an initial health point represented by a positive integer. If at any point his health point drops to <code>0</code> or below, he dies immediately.</p> <p>Some of the rooms are guarded by demons (represented by negative integers), so the knight loses health upon entering these rooms; other rooms are either empty (represented as 0) or contain magic orbs that increase the knight&rsquo;s health (represented by positive integers).</p> <p>To reach the princess as quickly as possible, the knight decides to move only <strong>rightward</strong> or <strong>downward</strong> in each step.</p> <p>Return <em>the knight&rsquo;s minimum initial health so that he can rescue the princess</em>.</p> <p><strong>Note</strong> that 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.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/03/13/dungeon-grid-1.jpg" alt="" /></p> <p><strong>Input:</strong> dungeon = [[-2,-3,3],[-5,-10,1],[10,30,-5]]</p> <p><strong>Output:</strong> 7</p> <p><strong>Explanation:</strong> The initial health of the knight must be at least 7 if he follows the optimal path: RIGHT-> RIGHT -> DOWN -> DOWN.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> dungeon = [[0]]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == dungeon.length</code></li> <li><code>n == dungeon[i].length</code></li> <li><code>1 <= m, n <= 200</code></li> <li><code>-1000 <= dungeon[i][j] <= 1000</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	calculateMinimumHP(int[][] dungeon)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

calculateMinimumHP

public int calculateMinimumHP(int[][] dungeon)