1. 题目
2. 题解
- 状态定义:dp[i] [j] 代表从棋盘的左上角开始,到达单元格 (i,j)时能拿到礼物的最大累计价值
- 转移方程:
- 初始值:左上角第一个元素,i = j = 0
- 当i = 0, j != 0 时 为矩阵第一行元素,只可从左边到达;
- 当i != 0, j = 0 时 为矩阵第一列元素,只可从上边到达;
- 当i != 0,j != 0 时 ,可从上边或左边到达;
class Solution {
public int maxValue(int[][] grid) {
int m = grid.length;
int n = grid[0].length;
int[][] dp = new int[m][n];
dp[0][0] = grid[0][0]; //初始点初始化
//固定列,第0行只能从上面算价值
for (int i = 1; i < m; i++) {
dp[i][0] = grid[i][0] + dp[i - 1][0];
}
//固定行,第0;列只能从左边算价值
for (int i = 1; i < n; i++) {
dp[0][i] = grid[0][i] + dp[0][i - 1];
}
//不固定行,列:取左/上 最大值
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
dp[i][j] = grid[i][j] + Math.max(dp[i - 1][j], dp[i][j - 1]);
}
}
return dp[m - 1][n - 1];
}
}
代码优化:
class Solution {
public int maxValue(int[][] grid) {
int m = grid.length;
int n = grid[0].length;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (i == 0 && j ==0)
continue;
if (i == 0)
grid[i][j] = grid[i][j] + grid[i][j - 1];
else if (j == 0)
grid[i][j] = grid[i][j] + grid[i - 1][j];
else {
grid[i][j] = grid[i][j] + Math.max(grid[i][j - 1], grid[i - 1][j]);
}
}
}
return grid[m - 1][n - 1];
}
}