原题链接：https://leetcode-cn.com/problems/li-wu-de-zui-da-jie-zhi-lcof/
动态规划
dp[i][j]表示到(i,j)这个点的最大价值状态转移
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + grid[i][j]代码
int maxValue(vector<vector<int>>& grid) { int m = grid.size(), n = grid[0].size(); vector<vector<int>> dp(m, vector<int>(n, 0)); dp[0][0] = grid[0][0]; for (int i = 1; i < n; i++) dp[0][i] = dp[0][i - 1] + grid[0][i]; for (int i = 1; i < m; i++) dp[i][0] = dp[i - 1][0] + grid[i][0]; for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + grid[i][j]; } } return dp[m - 1][n - 1]; }