【leetcode】Dungeon Game
Dungeon Game
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
.
-2 (K) | -3 | 3 |
-5 | -10 | 1 |
10 | 30 | -5 (P) |
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.
1 class Solution { 2 public: 3 int calculateMinimumHP(vector<vector<int> > &dungeon) { 4 5 int m=dungeon.size(); 6 int n=dungeon[0].size(); 7 vector<vector<int>> dp(m,vector<int>(n)); 8 9 dp[m-1][n-1]=max(-dungeon[m-1][n-1],0); 10 11 for(int i=m-2;i>=0;i--) 12 { 13 dp[i][n-1]=max(dp[i+1][n-1]-dungeon[i][n-1],0); 14 } 15 16 for(int j=n-2;j>=0;j--) 17 { 18 dp[m-1][j]=max(dp[m-1][j+1]-dungeon[m-1][j],0); 19 } 20 21 for(int i=m-2;i>=0;i--) 22 { 23 for(int j=n-2;j>=0;j--) 24 { 25 26 dp[i][j]=max(min(dp[i+1][j],dp[i][j+1])-dungeon[i][j],0); 27 } 28 } 29 30 return dp[0][0]+1; 31 } 32 };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 智能桌面机器人:用.NET IoT库控制舵机并多方法播放表情
· Linux glibc自带哈希表的用例及性能测试
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 新年开篇:在本地部署DeepSeek大模型实现联网增强的AI应用
· DeepSeek火爆全网,官网宕机?本地部署一个随便玩「LLM探索」
· Janus Pro:DeepSeek 开源革新,多模态 AI 的未来
· 互联网不景气了那就玩玩嵌入式吧,用纯.NET开发并制作一个智能桌面机器人(三):用.NET IoT库
· 上周热点回顾(1.20-1.26)