class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
vector<int> res(grid[0].size(),INT_MAX);
res[0]=0;
for(int i=0;i<grid.size();i++)
for(int j=0;j<grid[0].size();j++){
if(j>0) res[j]=grid[i][j]+min(res[j-1],res[j]);
else res[j]+=grid[i][j];
}
return res[grid[0].size()-1];
}
};
LeetCode Day52 minimum-path-sum
猜你喜欢
转载自blog.csdn.net/weixin_41394379/article/details/84931295
今日推荐
周排行