1
2
3
4
5
6
7
8
9
10
11
12
13
| class Solution {
public:
int maxValue(vector<vector<int>>& grid) {
for(int i = 1; i < grid.size(); ++i)
grid[i][0] += grid[i - 1][0];
for(int i = 1; i < grid[0].size(); ++i)
grid[0][i] += grid[0][i - 1];
for(int i = 1; i < grid.size(); ++i)
for(int j = 1; j < grid[0].size(); ++j)
grid[i][j] += max(grid[i - 1][j], grid[i][j - 1]);
return grid.back().back();
}
};
|