zoukankan      html  css  js  c++  java
  • leetcode[174]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.

    思路:典型的动态规划,从右下角往左上角走,先初始化右下角及最后一行,最后一列,

             然后计算f[i][j](f[i][j]表示进入第i行第j列的格子所需要的能量值):

            1)right=dungeon[i][j]<f[i][j+1]?f[i][j+1]-dungeon[i][j]:1;

            2)down=dungeon[i][j]<f[i+1][j]?f[i+1][j]-dungeon[i][j]:1;

            3)f[i][j]=right<down?right:down;

    class Solution {
    public:
    int calculateMinimumHP(vector<vector<int> > &dungeon) {
        if(dungeon.empty())return 1;
        int m=dungeon.size();
        if(dungeon[0].empty())return 1;
        int n=dungeon[0].size();
        vector<vector<int> >  f(m,vector<int> (n,0));
        f[m-1][n-1]=dungeon[m-1][n-1]<0?1-dungeon[m-1][n-1]:1;
        for(int i=m-2;i>=0;i--)
            f[i][n-1]=dungeon[i][n-1]<f[i+1][n-1]?f[i+1][n-1]-dungeon[i][n-1]:1;
        for(int j=n-2;j>=0;j--)
            f[m-1][j]=dungeon[m-1][j]<f[m-1][j+1]?f[m-1][j+1]-dungeon[m-1][j]:1;
        for(int i=m-2;i>=0;i--)
        {
            for(int j=n-2;j>=0;j--)
            {
                int right=dungeon[i][j]<f[i][j+1]?f[i][j+1]-dungeon[i][j]:1;
                int down=dungeon[i][j]<f[i+1][j]?f[i+1][j]-dungeon[i][j]:1;
                f[i][j]=right<down?right:down;
            }
        }
        return f[0][0];
    }
    };
  • 相关阅读:
    selenium-webdriver的二次封装(十)
    selenium-配置文件定位元素(九)
    selenium-获取元素属性(六)
    selenium-判断元素是否可见(五)
    selenium-确认进入了预期页面(四)
    selenium-启动浏览器(二)
    selenium-确定找到的element唯一(三)
    python-词云
    linux安装sqlcmd登录sqlserver
    在centos使用rpm包的方式安装mysql,以及更改root密码
  • 原文地址:https://www.cnblogs.com/Vae1990Silence/p/4280651.html
Copyright © 2011-2022 走看看