Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
Java:
public class Solution {
public int minPathSum(int[][] grid) {
if(grid.length==0) return 0;
int row = grid.length;
int col = grid[0].length;
int[][] min = new int[row][col];
min[0][0] = grid[0][0];
for(int i=1; i<row; i++)
{
min[i][0] = grid[i][0] + min[i-1][0];
}
for(int j=1;j<col;j++)
{
min[0][j] =grid[0][j] + min[0][j-1];
}
for(int i=1; i<row; i++)
{
for(int j=1; j<col; j++)
{
min[i][j] = grid[i][j] + Math.min(min[i][j-1], min[i-1][j]);
}
}
return min[row-1][col-1];
}
}