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.
Difficulty: Medium
public class Solution {
public int minPathSum(int[][] grid) {
int row = grid.length;
if(row == 0) return 0;
int col = grid[0].length;
for(int i = 0; i < row; i++){
for(int j = 0; j < col; j++){
if(i > 0 && j > 0){
grid[i][j] = Math.min(grid[i-1][j], grid[i][j-1]) + grid[i][j];
}
else if(i > 0){
grid[i][j] += grid[i-1][j];
}
else if(j > 0){
grid[i][j] += grid[i][j-1];
}
}
}
return grid[row - 1][col - 1];
}
}