一、题目
二、代码
class Solution
{
public:
int minPathSum(vector<vector<int>>& grid)
{
int i,j;
int return_int=0;
int height=grid.size();
int width=grid[0].size();
int temp_sum=0;
vector<vector<int>> dp(height,vector<int>(width,0));
dp[0][0]=grid[0][0];
for(i=1;i<width;i++) dp[0][i]=dp[0][i-1]+grid[0][i];
for(i=1;i<height;i++) dp[i][0]=dp[i-1][0]+grid[i][0];
for(i=1;i<height;i++)
{
for(j=1;j<width;j++)
{
dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j];
}
}
return dp[height-1][width-1];
}
};