My C++ dp solution

  • 2

    You can also view more solution on Github

    class Solution {
    	int calculateMinimumHP(vector<vector<int>>& dungeon) {
    		int m = dungeon.size();
    		int n = m==0?0:dungeon[0].size();
    		if (m==0 || n==0) return 0;
    		vector<vector<int>> dp(m, vector<int>(n));
    		for (int i=m-1; i>=0; i--)
    		for (int j=n-1; j>=0; j--)
    			if (i==m-1 && j==n-1)
    				dp[i][j] = max(1, 1-dungeon[i][j]);
    			else if (i==m-1)
    				dp[i][j] = max(1, dp[i][j+1]-dungeon[i][j]);
    			else if (j==n-1)
    				dp[i][j] = max(1, dp[i+1][j]-dungeon[i][j]);
    				dp[i][j] = max(1, min(dp[i][j+1], dp[i+1][j])-dungeon[i][j]);
    		return dp[0][0];

  • 0

    I love your solution!!! You are a genius, master of dp.

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.