We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8aa59f2 commit 7ccee95Copy full SHA for 7ccee95
0000.jian_zhi_offer/47/dynamic_programming.cpp
@@ -0,0 +1,29 @@
1
+class Solution
2
+{
3
+public:
4
+ int maxValue(vector<vector<int>>& grid)
5
+ {
6
+ std::vector<vector<int>> dp(grid.size());
7
+ for (auto& x : dp)
8
9
+ x.resize(grid.back().size());
10
+ }
11
+ dp[0][0] = grid[0][0];
12
+ for (int i = 1;i < grid.back().size();i++)
13
14
+ dp[0][i] = dp[0][i - 1] + grid[0][i];
15
16
+ for (int i = 1; i < grid.size();i++)
17
18
+ dp[i][0] = dp[i - 1][0] + grid[i][0];
19
20
+ for (int i = 1;i < grid.size();i++)
21
22
+ for (int j = 1;j < grid.front().size();j++)
23
24
+ dp[i][j] = std::max(dp[i][j - 1], dp[i - 1][j]) + grid[i][j];
25
26
27
+ return dp.back().back();
28
29
+};
0 commit comments