zoukankan      html  css  js  c++  java
  • LeetCode 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.
    Credits:
    Special thanks to @stellari for adding this problem and creating all test cases.
    

    原先想了一个保存(min_value, current_value)的方法,但是是不对的,只能从后往前做dp。

    class Solution {
    public:
        int calculateMinimumHP(vector<vector<int>>& dungeon) {
            int rows = dungeon.size();
            if (rows < 1) {
                return 1;
            }
            int cols = dungeon[0].size();
            if (cols < 1) {
                return 1;
            }
            
            vector<int> dp(cols + 1, INT_MAX);
            dp[cols - 1] = 1;
            
            for (int i=rows-1; i>=0; i--) {
                for (int j=cols-1; j>=0; j--) {
                    dp[j] = max(1, min(dp[j], dp[j + 1]) - dungeon[i][j]);
                }
            }
            return dp[0];
        }
    };
    
  • 相关阅读:
    ETF上线技术要素
    oracle修改用户的schema
    list
    交易系统分类OMS/EMS
    类的大小2
    webpack5教程
    vue配置stylelint教程
    提高国内访问 GitHub 的速度的 9 种方案
    git常见的操作
    img 图像底部留白的原因以及解决方法
  • 原文地址:https://www.cnblogs.com/lailailai/p/4622233.html
Copyright © 2011-2022 走看看