LeetCode: Dungeon Game

最新推荐文章于 2019-09-10 10:52:02 发布

原创最新推荐文章于 2019-09-10 10:52:02 发布 · 344 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

186 篇文章

订阅专栏

本文探讨了如何通过动态规划算法计算骑士在穿越迷宫时所需达到的最小初始生命值，以确保能够成功救援被困的公主。通过考虑迷宫中不同房间对骑士生命值的影响，该算法为骑士提供了最优路径选择建议。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    int calculateMinimumHP(vector<vector<int>>& dungeon) {
        int x = dungeon.size()-1;
        int y = dungeon[0].size()-1;
        int heal[x+1][y+1];
        heal[x][y] = dungeon[x][y] >= 0 ? 1 : 1-dungeon[x][y];
        for(int i = x-1; i >= 0; i--)
        {
            if(dungeon[i][y] >= 0)
            {
                heal[i][y] = (dungeon[i][y] - heal[i+1][y]) >= 0 ? 1 : heal[i+1][y] - dungeon[i][y];
            }
            else
            {
                heal[i][y] = heal[i+1][y] - dungeon[i][y];
            }
        }
        for(int i = y-1; i >= 0; i--)
        {
            if(dungeon[x][i] >= 0)
            {
                heal[x][i] = (dungeon[x][i] - heal[x][i+1]) >= 0 ? 1 : heal[x][i+1] - dungeon[x][i];
            }
            else
            {
                heal[x][i] = heal[x][i+1] - dungeon[x][i];
            }
        }
        
        for(int i = x-1; i >= 0; i--)
            for(int j = y-1; j >= 0; j--)
            {
                int pre = std::min(heal[i+1][j], heal[i][j+1]);
                if(dungeon[i][j] >= 0)
                {
                    heal[i][j] = (dungeon[i][j] - pre) >= 0 ? 1 : pre - dungeon[i][j];
                }
                else
                {
                    heal[i][j] = pre - dungeon[i][j];
                }                
            }
        
        return heal[0][0];
        
    }
};