64. Minimum Path Sum

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