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.

      

      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.

      这道题跟以前做过的不一样的是,动态规划的方向是从右下角到左上角。程序如下:

     1 class Solution {
     2 public:
     3     int calculateMinimumHP(vector<vector<int>>& dungeon) {
     4         int rows = dungeon.size();
     5         if(rows == 0)
     6             return 0;
     7         int cols = dungeon[0].size();
     8         
     9         vector<vector<int> > dp(rows, vector<int>(cols, INT_MIN));
    10         
    11         dp[rows-1][cols-1] = max(1, 1 - dungeon[rows-1][cols-1]);
    12         for(int i = rows - 2; i > -1; i--)
    13             dp[i][cols-1] = max(1, dp[i+1][cols-1] - dungeon[i][cols-1]);
    14         for(int j = cols - 2; j > -1; j--)
    15             dp[rows-1][j] = max(1, dp[rows-1][j+1] - dungeon[rows-1][j]);
    16         
    17         for(int i = rows - 2; i > -1; i--)
    18             for(int j = cols - 2; j > -1; j--)
    19                 dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]);
    20         
    21         return dp[0][0];
    22     }
    23 };
  • 相关阅读:
    内存泄露检测工具之DMalloc
    五年后你在何方
    程序员技术练级攻略
    Windows编程革命简史
    su的时候密码认证失败的解决方法
    ruby 元编程 meta programming
    内存对齐分配策略(含位域模式)
    Ruby 之 Block, Proc, Lambda 联系区别,转载
    c++异常处理机制示例及讲解
    ruby 常见问题集 1 不断更新中
  • 原文地址:https://www.cnblogs.com/xiehongfeng100/p/4589536.html
Copyright © 2011-2022 走看看