1. 题目
在一个 m*n 的棋盘的每一格都放有一个礼物,每个礼物都有一定的价值(价值大于 0)。你可以从棋盘的左上角开始拿格子里的礼物,并每次向右或者向下移动一格、直
到到达棋盘的右下角。给定一个棋盘及其上面的礼物的价值,请计算你最多能拿到多少价值的礼物?
示例 1:
输入:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
输出: 12
解释: 路径 1→3→5→2→1 可以拿到最多价值的礼物
提示:
0 < grid.length <= 200
0 < grid[0].length <= 200
Related Topics 动态规划
👍 142 👎 0
2. 题解
2.1 解法1: 动态规划
- 状态数组: dp[i][j] 代表到达该位置时的最大值
- 递推公式:
当 i!=0, j!=0, dp[i][j] = max(dp[i-1][j], dp[i][j-1])+grid[i][j]
当 i=0, j!=0, dp[i][j] = dp[i][j-1] + grid[i][j]
3. 空间优化: 1.可以使用原数组代替dp数组 2. 先初始化第一行和第一列
class Solution {
public int maxValue(int[][] grid) {
int ans = 0;
int[][] dp = new int[grid.length][grid[0].length];
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (i == 0 && j == 0) {
dp[i][j] = grid[i][j];
} else if (i != 0 && j == 0) {
dp[i][j] = dp[i - 1][j] + grid[i][j];
} else if (i == 0 && j != 0) {
dp[i][j] = dp[i][j - 1] + grid[i][j];
} else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
}
}
}
return dp[grid.length - 1][grid[0].length - 1];
}
}
优化版本:
class Solution {
public int maxValue(int[][] grid) {
int m = grid.length;
int n = grid[0].length;
for (int i = 1; i < n; i++) {
grid[0][i] += grid[0][i - 1];
}
for (int i = 1; i < m; i++) {
grid[i][0] += grid[i - 1][0];
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
grid[i][j] = Math.max(grid[i - 1][j], grid[i][j - 1]) + grid[i][j];
}
}
return grid[m - 1][n - 1];
}
}
2.2 解法1: 暴力递归(超时)
每次向下或向右走
class Solution {
int ans;
int row, col;
int[][] grid;
public int maxValue(int[][] grid) {
if (grid.length == 0 || grid[0].length == 0) {
return 0;
}
this.grid = grid;
row = grid.length;
col = grid[0].length;
dfs(0, 0, grid[0][0]);
return ans;
}
public void dfs(int x, int y, int sum) {
if (x == row - 1 && y == col - 1) {
ans = Math.max(sum, ans);
}
if (x >= row || y >= col) {
return;
}
if (x + 1 < row) {
dfs(x + 1, y, sum + grid[x + 1][y]);
}
if (y + 1 < col) {
dfs(x, y + 1, sum + grid[x][y + 1]);
}
}
}