Dungeon Game ——动态规划
2015-07-30 16:37
369 查看
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
运用动态规划的思想,在每个节点,其HP最小为1。从P处往回推导,每个位置HP最小为1,又必须保证能到达P处。
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
运用动态规划的思想,在每个节点,其HP最小为1。从P处往回推导,每个位置HP最小为1,又必须保证能到达P处。
class Solution { public: int calculateMinimumHP(vector<vector<int>>& dungeon) { if(dungeon.empty()||dungeon[0].empty()) return 1; int m,n; m=dungeon.size(); n=dungeon[0].size(); vector<vector<int>> minHP(m,vector<int>(n,0)); for(int i=m-1;i>=0;i--) { for(int j=n-1;j>=0;j--) { if(i==m-1&&j==n-1) minHP[i][j]=max(1,1-dungeon[i][j]); else if(i==m-1) { minHP[i][j]=max(1,(minHP[i][j+1]-dungeon[i][j])); } else if(j==n-1) minHP[i][j]=max(1,(minHP[i+1][j]-dungeon[i][j])); else minHP[i][j]=max(1,min(minHP[i+1][j]-dungeon[i][j],minHP[i][j+1]-dungeon[i][j])); } } return minHP[0][0]; } };
相关文章推荐
- Java面向对象的基本特征
- java反射学习笔记-core java
- ADNROID XML图像资源文件详细讲解(三)
- Windows Server 2003复制大文件出错:服务器资源系统资源不足,无法完成请求的服务
- Fedora22环境下Python3.4+Django1.8+MySQL5.6环境搭建
- php异常、错误处理机制
- java成员内部类学习笔记
- python基础知识
- OS X 10.10.4系统,命名为“Yosemite”(优胜美地)
- android 消息机制
- CentOS6.5 服务器+apache5.3绑定多个域名+SELinux设置
- 修改会员等级
- 数据分析之美:决策树
- leetcode 069 —— Sqrt(x)
- android开发中获取系统时间方法
- c转汇编
- Mysql基本检索数据方法大全
- 制作MACOSX10.10.3/10.9安装启动盘U盘的教程
- 安卓电量读取
- 关于nginx的1W并发的优化