leetcode-64-最小路径和
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
for (int i=1; i<grid[0].size(); i++) grid[0][i] += grid[0][i-1];
for (int i=1; i<grid.size(); i++){
grid[i][0] += grid[i-1][0];
for (int j=1; j<grid[i].size(); j++) grid[i][j] += min(grid[i-1][j], grid[i][j-1]);
}
return grid.back().back();
}
};