class Solution {
public:
int minPathSum(vector<vector<int>>& grid)
{
if(grid.empty()||grid[0].empty())
return 0;
int m=grid.size();
int n=grid[0].size();
vector<vector<int>> dp(m,vector<int>(n,0));
dp[0][0]=grid[0][0];
for(int i=1;i<m;++i)
dp[i][0]=dp[i-1][0]+grid[i][0];
for(int j=1;j<n;++j)
dp[0][j]=dp[0][j-1]+grid[0][j];
for(int i=1;i<m;++i)
{
for(int j=1;j<n;++j)
{
dp[i][j]=grid[i][j]+min(dp[i-1][j],dp[i][j-1]);
}
}
return dp[m-1][n-1];
}
};
Minimum Path Sum
最新推荐文章于 2019-03-28 21:33:42 发布