```
public static int minPathSum(int[][] grid) {
int[][] temp = new int[grid.length][grid[0].length];
// use an additional temp to store temporary minimal sum
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if(i == 0 && j == 0) temp[i][j] = grid[i][j];
else if(i == 0) temp[i][j] = temp[i][j - 1] + grid[i][j];
else if(j == 0) temp[i][j] = temp[i - 1][j] + grid[i][j];
else temp[i][j] = Math.min(temp[i][j - 1], temp[i - 1][j]) + grid[i][j];
}
}
return temp[grid.length - 1][grid[0].length - 1];
}
```