Description

Submission

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