64. Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right whichminimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

public class Solution {
    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        for(int i=1; i<m; i++){
            grid[i][0] = grid[i][0] + grid[i-1][0];
        }
        for(int j=1; j<n; j++){
            grid[0][j] = grid[0][j] + grid[0][j-1];
        }
        for(int i=1; i<m; i++){
            for(int j=1; j<n; j++){
                grid[i][j] = grid[i][j] + (grid[i-1][j] <= grid[i][j-1] ? grid[i-1][j] : grid[i][j-1]);
            }
        }
        return  grid[m-1][n-1];
    }
}