Minimum path sum

Given a m x n gridfilled
with non-negative numbers, find a path from top left tobottom right which minimizes thesum
of all numbers along its path.

public class Solution {
public intminPathSum(int[][] grid) {
// Start typing your Java solution below
// DO NOT write main() function
int row = grid.length;
int col = grid[0].length;
int[][] map = new int[row][col];

for (int i = 0; i < row; i++) {
for (int j= 0; j < col; j++) {
if (i == 0 && j == 0){
map[i][j] = grid[i][j];
} else if (i == 0) {
map[i][j] = grid[i][j] + map[i][j-1];
} else if (j == 0) {
map[i][j] = map[i-1][j] + grid[i][j];
} else {
map[i][j] = Math.min((map[i-1][j] + grid[i][j]),(map[i][j-1] + grid[i][j]));
}
}
}
return map[row-1][col-1];
}
}