LeetCode #174 Dungeon Game
2015-08-10 11:40
267 查看
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.
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) |
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.
class Solution { public: int calculateMinimumHP(vector<vector<int> >& d) { vector<int> dp(d[0].size() + 1, INT_MAX); dp[d[0].size() - 1] = 1; for (int i = d.size() - 1; i >= 0; i--) for (int j = d[0].size() - 1; j >= 0; j--) dp[j] = max(1, min(dp[j + 1], dp[j]) - d[i][j]); return dp[0]; } };
相关文章推荐
- case 应用
- 避免Android中Context引起的内存泄露
- 精度计算——乘法(大数乘大数)
- hdoj1010Starship Troopers (树dp,依赖背包)
- 关于限制域用户登陆计算机的几点总结
- oracle创建一个数据库三步走
- owncloud源码分析2--数据库增删改查
- 获得窗口句柄
- 约瑟夫环数组实现
- iOS 9 适配系列教程
- 自定义ProgressBar
- 创建弹出式菜单
- 精度计算——乘法(大数乘小数)
- ListView动态添加控件
- 八大排序算法
- 结构体偏移量
- GIT与GitHub使用简介
- NOI2004郁闷的出纳员题解
- (1)关键指标-吞吐率
- js弹出窗口、右下角浮动窗体(最小化最大化关闭)