zoukankan      html  css  js  c++  java
  • [leedcode 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.
        public class Solution {
            public int calculateMinimumHP(int[][] dungeon) {
             /* dp思想,而且是从右下到左上,倒着走。
                dp[i][j]的意义是到i,j点所需的最少生命值,注意先考虑最后一行和最后一列
                遍历中间点时注意,从右下到左上
                注意最后结果需要加1!!
                */
                if(dungeon==null||dungeon.length<=0||dungeon[0].length<=0) return -1;
                int row=dungeon.length;
                int col=dungeon[0].length;
                int[][] dp=new int[row][col];
                dp[row-1][col-1]=Math.max(0-dungeon[row-1][col-1],0);
                for(int i=row-2;i>=0;i--){
                    dp[i][col-1]=Math.max(dp[i+1][col-1]-dungeon[i][col-1],0);
                }
                for(int i=col-2;i>=0;i--){
                    dp[row-1][i]=Math.max(dp[row-1][i+1]-dungeon[row-1][i],0);
                }
                for(int i=row-2;i>=0;i--){
                    for(int j=col-2;j>=0;j--){
                        dp[i][j]=Math.max(Math.min(dp[i+1][j],dp[i][j+1])-dungeon[i][j],0);
                    }
                }
                return dp[0][0]+1;
            }
        }
  • 相关阅读:
    gcc编译器
    samba服务器
    NFS服务器
    tftp服务器配置过程
    centos6.5下编译hello.ko驱动程序
    使用poi导出数据到excel
    使用poi根据模版生成word文档,支持插入数据和图片
    使用javaMail实现简单邮件发送
    outlook2016用Exchange轻松绑定腾讯企业邮箱
    Python Pyinstaller打包含pandas库的py文件遇到的坑
  • 原文地址:https://www.cnblogs.com/qiaomu/p/4696461.html
Copyright © 2011-2022 走看看