64_MinimumPathSum - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int n= grid.size(),  m =grid[0].size();
        vector<vector<int>> dp = grid;
        //  1   3   1       1   4   4
        //  1   5   1
        //  4   2   1
        for(int i=0;i<n;++i){
            for(int j = 0;j< m ; ++j){
                if(i==0 && j==0) continue;
                else if(i==0) dp[i][j]+=dp[i][j-1];
                else if(j==0) dp[i][j]+=dp[i-1][j];
                else dp[i][j] += min(dp[i-1][j], dp[i][j-1]);
            }
        }
        return dp[n-1][m-1];
    }
};

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int n= grid.size(),  m =grid[0].size();
        vector<int> dp(m,0);
        dp[0] = grid[0][0];
        //  1   3   1       1   4   4
        //  1   5   1       
        //  4   2   1
        for(int i=0;i<n;++i){
            for(int j = 0;j< m ; ++j){
                if(i==0 && j==0) dp[j] = grid[i][j];
                else if(i==0) dp[j] = grid[i][j] + dp[j-1];
                else if(j==0) dp[j] += grid[i][j];
                else dp[j] = min(dp[j], dp[j-1])+ grid[i][j];
            }
        }
        return dp[m-1];
    }
};

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int n= grid.size(),  m =grid[0].size();
        //  1   3   1       1   4   4
        //  1   5   1       
        //  4   2   1
        for(int i=0;i<n;++i){
            for(int j = 0;j< m ; ++j){
                if(i==0 && j==0) continue;
                else if(i==0) grid[i][j] += grid[i][j-1];
                else if(j==0) grid[i][j] += grid[i-1][j];
                else grid[i][j] += min(grid[i-1][j], grid[i][j-1]);
            }
        }
        return grid[n-1][m-1];
    }
};