题目链接
解题思路
动态规划。
- 初始值: f [ 0 ] [ 0 ] = g r i d [ 0 ] [ 0 ] f[0][0] = grid[0][0] f[0][0]=grid[0][0]
- 对于第一行和第一列单独考虑:
// 1st col && row for (int i = 1; i < grid[0].size(); i++) { f[0][i] = grid[0][i] + f[0][i - 1]; } for (int i = 1; i < grid.size(); i++) { f[i][0] = grid[i][0] + f[i - 1][0]; }
- 对于其他元素,根据题目意思(每次向右或者向下移动一格),可以得到这里的每一个元素都由它上方一个或左边一个的最大值 +
g
r
i
d
[
i
]
[
j
]
grid[i][j]
grid[i][j] 决定,即有:
f [ i ] [ j ] = g r i d [ i ] [ j ] + max { f [ i − 1 ] [ j ] , f [ i ] [ j − 1 ] } , i ≥ 1 , j ≥ 1 f[i][j] = grid[i][j] + \max\{f[i-1][j], f[i][j - 1]\}, i\ge1, j\ge1 f[i][j]=grid[i][j]+max{f[i−1][j],f[i][j−1]},i≥1,j≥1 - 最后直接返回 矩阵f 的最后一列最后一行的元素即可。
实现代码(C++)
class Solution {
public:
int maxValue(vector<vector<int>>& grid) {
vector<vector<int>> f(grid.size(), vector<int>(grid[0].size()));
f[0][0] = grid[0][0];
// 1st col && row
for (int i = 1; i < grid[0].size(); i++) {
f[0][i] = grid[0][i] + f[0][i - 1];
}
for (int i = 1; i < grid.size(); i++) {
f[i][0] = grid[i][0] + f[i - 1][0];
}
for (int i = 1; i < grid.size(); i++) {
for (int j = 1; j < grid[0].size(); j++) {
f[i][j] = max(f[i - 1][j] + grid[i][j], f[i][j - 1] + grid[i][j]);
}
}
return f.back().back();
}
};