class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
for(int i=0;i<grid.size();i++){
for(int j=0;j<grid[i].size();j++){
if((i-1)>=0&&(j-1)>=0){
grid[i][j] = grid[i][j]+min(grid[i-1][j],grid[i][j-1]);
}else if((i-1)>=0&&(j-1)<0){
grid[i][j] = grid[i][j]+grid[i-1][j];
}else if((i-1)<0&&(j-1)>=0){
grid[i][j] = grid[i][j]+grid[i][j-1];
}else{
grid[i][j]=grid[i][j];
}
}
}
return grid[grid.size()-1][grid[0].size()-1];
}
};
LeetCode; 64. 最小路径和 ; 标签:动态规划
最新推荐文章于 2024-10-16 00:00:43 发布