Minimum Path Sum

class Solution {
public:
int minPathSum(vector<vector<int> > &grid) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int row=grid.size();
if(row==0)return 0;
int col=grid[0].size();
int i,j;
for(i=0;i<row;++i){
for(j=0;j<col;++j){
if(i>0&&j>0){
grid[i][j]+=min(grid[i-1][j],grid[i][j-1]);
}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];
}
};