leetcode+ 二维数组上的DP

点击打开链接

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-1][n] = 1;
        for(int i = m-1; i>=0; i--){
            for(int j=n-1; j>=0; j--){
                int val = min(dp[i+1][j], dp[i][j+1])-dungeon[i][j];
                dp[i][j] = max(val, 1);
            }
        }
        return dp[0][0];
    }
};