zoukankan      html  css  js  c++  java
  • 174.Dungeon Game

    class Solution {
    public:
        int calculateMinimumHP(vector<vector<int>>& dungeon) {
            int m = dungeon.size(), n = dungeon[0].size();
            vector<vector<int>> dp(m + 1, vector<int>(n + 1, INT_MAX));
            dp[m][n - 1] = 1; dp[m - 1][n] = 1;
            for (int i = m - 1; i >= 0; --i) {
                for (int j = n - 1; j >= 0; --j) {
                    dp[i][j] = max(1, min(dp[i + 1][j], dp[i][j + 1]) - dungeon[i][j]);
                }
            }
            return dp[0][0];
        }
    };
    
    class Solution {
    public:
        int calculateMinimumHP(vector<vector<int>>& dungeon) {
            int m = dungeon.size(), n = dungeon[0].size();
            vector<int> dp(n + 1, INT_MAX);
            dp[n - 1] = 1;
            for (int i = m - 1; i >= 0; --i) {
                for (int j = n - 1; j >= 0; --j) {
                    dp[j] = max(1, min(dp[j], dp[j + 1]) - dungeon[i][j]);
                }
            }
            return dp[0];
        }
    };
    
  • 相关阅读:
    运算符
    数据运算
    login_code
    headless&unittest
    dict-test
    list_test
    string_test
    python1113
    堆排序
    java线程同步问题
  • 原文地址:https://www.cnblogs.com/smallredness/p/10694144.html
Copyright © 2011-2022 走看看