class Solution {
public:
int minPathSum(
vector<
vector<
int>>&
grid) {
int m =
grid.
size();
int n =
grid[
0].
size();
vector<
int> cur(m,
grid[
0][
0]);
for (
int i =
1; i < m; i++)
cur[i] = cur[i -
1] +
grid[i][
0];
for (
int j =
1; j < n; j++) {
cur[
0] +=
grid[
0][j];
for (
int i =
1; i < m; i++)
cur[i] =
min(cur[i -
1], cur[i]) +
grid[i][j];
}
return cur[m -
1];
}
};
转载请注明原文地址: https://www.6miu.com/read-54879.html