LeetCode //C - 174. Dungeon Game

174. Dungeon Game

The demons had captured the princess 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 was initially positioned in the top-left room and must fight his way through 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 (represented by negative integers), so the knight loses health upon entering these rooms; other rooms are either empty (represented as 0) or contain magic orbs that increase the knight's health (represented by positive integers).

To reach the princess as quickly as possible, the knight decides to move only rightward or downward in each step.

Return the knight's minimum initial health so that he can rescue the princess.

Note that 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.

Example 1:

Input: dungeon = [[-2,-3,3],[-5,-10,1],[10,30,-5]]
Output: 7
Explanation: The initial health of the knight must be at least 7 if he follows the optimal path: RIGHT-> RIGHT -> DOWN -> DOWN.

Example 2:

Input: dungeon = [[0]]
Output: 1

Constraints:
  • m == dungeon.length
  • n == dungeon[i].length
  • 1 <= m, n <= 200
  • -1000 <= dungeon[i][j] <= 1000

From: LeetCode

Link: 174. Dungeon Game


Solution:

Ideas:

1. Dynamic Programming Table (DP Table):

  • Create a 2D array dp where dp[i][j] stores the minimum initial health required to reach the princess starting from cell (i, j).

2. Base Case Initialization:

  • For the princess's cell (m-1, n-1), set dp[m-1][n-1] to the maximum of 1 and 1 - dungeon[m-1][n-1].

3. Filling the DP Table:

  • Last Column: Calculate minimum health for each cell in the last column based on the cell below it.
  • Last Row: Calculate minimum health for each cell in the last row based on the cell to the right.
  • Other Cells: For each cell (i, j), compute the minimum health based on the minimum of the right and below cells, adjusted by the current cell's value. If the resulting health is less than or equal to 0, set it to 1.

4. Result:

  • The value in dp[0][0] represents the minimum initial health required for the knight to rescue the princess starting from the top-left corner.
Code:
c 复制代码
int calculateMinimumHP(int** dungeon, int dungeonSize, int* dungeonColSize) {
    int m = dungeonSize;
    int n = dungeonColSize[0];
    int dp[m][n];
    
    dp[m-1][n-1] = dungeon[m-1][n-1] > 0 ? 1 : 1 - dungeon[m-1][n-1];
    
    for (int i = m - 2; i >= 0; i--) {
        dp[i][n-1] = dp[i+1][n-1] - dungeon[i][n-1];
        if (dp[i][n-1] <= 0) dp[i][n-1] = 1;
    }
    
    for (int j = n - 2; j >= 0; j--) {
        dp[m-1][j] = dp[m-1][j+1] - dungeon[m-1][j];
        if (dp[m-1][j] <= 0) dp[m-1][j] = 1;
    }
    
    for (int i = m - 2; i >= 0; i--) {
        for (int j = n - 2; j >= 0; j--) {
            int min_health_on_exit = dp[i+1][j] < dp[i][j+1] ? dp[i+1][j] : dp[i][j+1];
            dp[i][j] = min_health_on_exit - dungeon[i][j];
            if (dp[i][j] <= 0) dp[i][j] = 1;
        }
    }
    
    return dp[0][0];
}
相关推荐
岁忧1 小时前
(LeetCode 面试经典 150 题 ) 11. 盛最多水的容器 (贪心+双指针)
java·c++·算法·leetcode·面试·go
chao_7891 小时前
二分查找篇——搜索旋转排序数组【LeetCode】两次二分查找
开发语言·数据结构·python·算法·leetcode
秋说3 小时前
【PTA数据结构 | C语言版】一元多项式求导
c语言·数据结构·算法
Maybyy3 小时前
力扣61.旋转链表
算法·leetcode·链表
暮鹤筠4 小时前
[C语言初阶]操作符
c语言·开发语言
卡卡卡卡罗特5 小时前
每日mysql
数据结构·算法
chao_7896 小时前
二分查找篇——搜索旋转排序数组【LeetCode】一次二分查找
数据结构·python·算法·leetcode·二分查找
lifallen7 小时前
Paimon 原子提交实现
java·大数据·数据结构·数据库·后端·算法
lixzest7 小时前
C++ Lambda 表达式详解
服务器·开发语言·c++·算法
EndingCoder7 小时前
搜索算法在前端的实践
前端·算法·性能优化·状态模式·搜索算法