[LeetCode 174] Dungeon Game
2015-09-30 13:59
393 查看
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
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.
solution:
can use 2d - DP , use matrix to store the value, each element means minimum health to get to bottom right.
Also can simply to 1d array
public class Solution {
public int calculateMinimumHP(int[][] dungeon) {
if(dungeon.length<=0 || dungeon[0].length<=0) return 1;
int row = dungeon.length;
int col = dungeon[0].length;
int[][] ans = new int[row][col];
ans[row-1][col-1] = (dungeon[row-1][col-1] >=0) ? 0: Math.abs(dungeon[row-1][col-1]);
for(int i = col-2;i>=0;i--) {
ans[row-1][i] = (dungeon[row-1][i]>=ans[row-1][i+1]) ? 0: (ans[row-1][i+1]-dungeon[row-1][i]);
}
for(int j = row-2;j>=0;j--) {
ans[j][col-1] = (dungeon[j][col-1]>=ans[j+1][col-1]) ? 0: (ans[j+1][col-1]-dungeon[j][col-1]);
}
for(int i = row-2;i>=0;i--) {
for(int j = col-2;j>=0;j--) {
int t1 = (dungeon[i][j]>=ans[i+1][j]) ? 0: (ans[i+1][j]-dungeon[i][j]);
int t2 = (dungeon[i][j]>=ans[i][j+1]) ? 0: (ans[i][j+1]-dungeon[i][j]);
ans[i][j] = Math.min(t1, t2);
}
}
return ans[0][0]+1;
}
}
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) |
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.
solution:
can use 2d - DP , use matrix to store the value, each element means minimum health to get to bottom right.
Also can simply to 1d array
public class Solution {
public int calculateMinimumHP(int[][] dungeon) {
if(dungeon.length<=0 || dungeon[0].length<=0) return 1;
int row = dungeon.length;
int col = dungeon[0].length;
int[][] ans = new int[row][col];
ans[row-1][col-1] = (dungeon[row-1][col-1] >=0) ? 0: Math.abs(dungeon[row-1][col-1]);
for(int i = col-2;i>=0;i--) {
ans[row-1][i] = (dungeon[row-1][i]>=ans[row-1][i+1]) ? 0: (ans[row-1][i+1]-dungeon[row-1][i]);
}
for(int j = row-2;j>=0;j--) {
ans[j][col-1] = (dungeon[j][col-1]>=ans[j+1][col-1]) ? 0: (ans[j+1][col-1]-dungeon[j][col-1]);
}
for(int i = row-2;i>=0;i--) {
for(int j = col-2;j>=0;j--) {
int t1 = (dungeon[i][j]>=ans[i+1][j]) ? 0: (ans[i+1][j]-dungeon[i][j]);
int t2 = (dungeon[i][j]>=ans[i][j+1]) ? 0: (ans[i][j+1]-dungeon[i][j]);
ans[i][j] = Math.min(t1, t2);
}
}
return ans[0][0]+1;
}
}
相关文章推荐
- 基于Android中dp和px之间进行转换的实现代码
- Android中dip、dp、sp、pt和px的区别详解
- LFC1.0.0 版本发布
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- Android px、dp、sp之间相互转换
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- android中像素单位dp、px、pt、sp的比较
- LeetCode[Day 1] Two Sum 题解