给定一个只含非负整数的m*n网格,找到一条从左上角到右下角的可以使数字和最小的路径。
注意事项
你在同一时间只能向下或者向右移动一步
点题:越是简单,越容易犯错。勿以题小而不为!
1. 溢出安全,凡是涉及到+, *的地方,都要考虑到溢出安全
2. 边界条件
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
int m = grid.size();
if (m == 0) {
return 0;
}
int n = grid[0].size();
if (n == 0) {
return 0;
}
vector<long long> line(n + 1, LLONG_MAX);
vector<vector<long long>> status(m + 1, line);
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (i == 1 && j == 1) {
status[i][j] = grid[i - 1][j - 1];
} else {
status[i][j] = min(status[i - 1][j], status[i][j - 1]);
status[i][j] += grid[i - 1][j - 1];
}
}
}
return status[m][n];
}
};