[leetcode]Dungeon Game
来源:互联网 发布:狼群算法 编辑:程序博客网 时间:2024/05/21 08: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.
Credits:
Special thanks to @stellari for adding this problem and creating all test cases.
class Solution {public: int calculateMinimumHP(vector<vector<int>>& dungeon) { int m=dungeon.size(); if(0==m) return 1; int n=dungeon[0].size(); dungeon[m-1][n-1]=max(0-dungeon[m-1][n-1],0); for(int i=m-2;i>=0;i--){ dungeon[i][n-1]=max(dungeon[i+1][n-1]-dungeon[i][n-1],0); } for(int j=n-2;j>=0;j--){ dungeon[m-1][j]=max(dungeon[m-1][j+1]-dungeon[m-1][j],0); } for(int i=m-2;i>=0;i--){ for(int j=n-2;j>=0;j--){ dungeon[i][j]=max(min(dungeon[i+1][j],dungeon[i][j+1])-dungeon[i][j],0); } } return dungeon[0][0]+1; }};
- [leetcode] Dungeon Game
- leetcode 174: Dungeon Game
- [leetcode 174] Dungeon Game
- [leetcode] Dungeon Game
- Leetcode Dungeon Game
- LeetCode Dungeon Game
- LeetCode: Dungeon Game
- [LeetCode] Dungeon Game
- [leetcode] Dungeon Game
- LeetCode Dungeon Game
- [LeetCode]Dungeon Game
- Leetcode OJ Dungeon Game
- Leetcode: Dungeon Game
- leetcode dungeon game
- [leetcode]Dungeon Game
- LeetCode(174) Dungeon Game
- LeetCode 174 Dungeon Game
- LeetCode - Dungeon Game
- CMake----if与option使用小记
- windows service调试
- 快速掌握一个语言最常用的50%
- mongodb副本集
- mac os 多屏显示Dock
- [leetcode]Dungeon Game
- Android bindService的例子
- 静态链接
- 时间段合并
- Linux IPC通信机制
- Xcode控件使用笔记四:UITableView-自定义Cell
- 堆排序算法的C语言和Python版本源码实现
- sum(col1) over(partition by col2 order by col3 )
- 如何优雅的写分页(伪代码) 一