思路:
通过第一列初始化0~m-1行, 每一轮推进一列.
e.g. distance[i]开始时保存通过第0列至第i行的最小距离
对于distance[0],要得到第j轮的distance[0],只有其左边位置向右一步这一种方式,即:
distance[0] += grid[0][j];
对于其他distance[i],要得到第j轮的distance[i],可通过从上向下走一步或从左向右走一步走至,即:
distance[i] = min(distance[i-1], distance[i]) + grid[i][j];
注:由于是从上往下层层计算,故算至distance[i]时, distance[i-1]已经算过了,即到grid[i-1][j]的最小距离(句中表示从上至下走↓)
min()中的distance[i], 表示的是指grid[i][j-1]的最小距离(句中表示从左至右走→)
图示:
代码:
class Solution {
public:
/**
* @param grid: a list of lists of integers.
* @return: An integer, minimizes the sum of all numbers along its path
*/
int minPathSum(vector<vector<int> > &grid) {
// write your code here
if(grid.empty())
return 0;
int m = grid.size(), n = grid[0].size();
// --begin
vector<int> distance(m, grid[0][0]);
for(int i = 1;i < m; ++i)
distance[i] = distance[i - 1] + grid[i][0];
// --end distance[i]是经第0列到grid[i][0]的最小值
for(int j = 1; j < n; ++j){
distance[0] += grid[0][j];
for(int i = 1; i < m; ++i){
// 此时distance[i-1]已经计算过,刚好可以看成比较上和左
distance[i] = min(distance[i - 1], distance[i]) + grid[i][j];
}
}
return distance[m - 1];
}
};
致谢:
[LintCode]最小路径和