class Solution {
public:
int dp[1005][1005];
int minPathSum(vector<vector<int> > &grid) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(grid.size()==0||grid[0].size()==0)
return 0;
dp[0][0]=grid[0][0];
for(int i=1;i<=grid.size()-1;i++)
dp[i][0]=dp[i-1][0]+grid[i][0];
for(int i=1;i<=grid[0].size()-1;i++)
dp[0][i]=dp[0][i-1]+grid[0][i];
for(int i=1;i<=grid.size()-1;i++)
for(int j=1;j<=grid[0].size()-1;j++)
{
dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j];
}
return dp[grid.size()-1][grid[0].size()-1];
}
};
【leetcode】Minimum Path Sum
最新推荐文章于 2020-03-21 17:46:13 发布