64. Minimum Path Sum

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.

Subscribe to see which companies asked this question

class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
if(grid.size()==0) return 0;
int row=grid.size();
int column=grid[0].size();
for(int i=1;i<column;++i)
grid[0][i]=grid[0][i-1]+grid[0][i];
for(int i=1;i<row;++i)
grid[i][0]=grid[i-1][0]+grid[i][0];
for(int i=1;i<row;++i)
for(int j=1;j<column;++j)
{
grid[i][j]=min(grid[i][j-1],grid[i-1][j])+grid[i][j];
}
return grid[row-1][column-1];

}
};