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];
        }
    };
    
  • 相关阅读:
    Oracle--数据增删改
    Oracle--约束
    Oracle--常用数据类型、创建表
    Oracle基础入门--(用户、角色、权限)
    Oracle基础入门--(数据库、数据库实例、表空间)
    jQuery中的表单验证
    js 判断微信浏览器
    VUE 之 webpack 封装方法例子
    原创自己写的方法,获取url上的参数,返回一个对象
    axios拦截器配合element ui实现http请求的全局加载
  • 原文地址:https://www.cnblogs.com/lailailai/p/4622233.html
Copyright © 2011-2022 走看看