My C++ DP Simple Solution


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

Log in to reply
 

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