zoukankan      html  css  js  c++  java
  • Java for 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.

    解题思路:

    dp问题,有两种思路:

    思路一:dp[i][j]表示从起点到dungeon[i][j]所需的最小血量,但是这种思路递推方程非常不好写

    思路二:dp[i][j]表示从dungeon[i][j]到终点所需的最小血量,使用一维数组即可,递推方程

    dp[j] = dungeon[i][j] >= Math.min(dp[j + 1], dp[j]) - 1 ? 1: Math.min(dp[j + 1], dp[j]) - dungeon[i][j]

    当然,也可以直接用dungeon[i][j]数组替代dp[]数组,JAVA实现如下:

        public int calculateMinimumHP(int[][] dungeon) {
    		int[] dp = new int[dungeon[0].length];
    		dp[dungeon[0].length - 1] = dungeon[dungeon.length - 1][dungeon[0].length - 1] >= 0 ? 1
    				: 1 - dungeon[dungeon.length - 1][dungeon[0].length - 1];
    		for (int i = dungeon[0].length - 2; i >= 0; i--)
    			dp[i] = dungeon[dungeon.length - 1][i] >= dp[i + 1] - 1 ? 1
    					: dp[i + 1] - dungeon[dungeon.length - 1][i];
    		for (int i = dungeon.length - 2; i >= 0; i--) {
    			dp[dungeon[0].length - 1] = dungeon[i][dungeon[0].length - 1] >= dp[dungeon[0].length - 1] - 1 ? 1
    					: dp[dungeon[0].length - 1]
    							- dungeon[i][dungeon[0].length - 1];
    			for (int j = dungeon[0].length - 2; j >= 0; j--)
    				dp[j] = dungeon[i][j] >= Math.min(dp[j + 1], dp[j]) - 1 ? 1
    						: Math.min(dp[j + 1], dp[j]) - dungeon[i][j];
    		}
    		return dp[0];
        }
    
  • 相关阅读:
    rdp远程Windows10连接不上的解决方案
    win10系统RuntimeBroker.exe进程占用大量cpu的解决方案
    win10磁盘管理中的“可用压缩空间大小”太小的解决方案
    修改windows10的默认字体为新宋体(并且容易区分小写l和数字1)
    WPS表格自动生成序号(不受增删影响)
    服务器CPU中的E3、E5的区别,及V2、V3、V5的区别
    屏蔽WPS广告
    解析腾讯视频真实地址
    qlv to mp4
    uefi + gpt 安装 Windows7(用Rufus制作U盘启动工具)
  • 原文地址:https://www.cnblogs.com/tonyluis/p/4557004.html
Copyright © 2011-2022 走看看