剑指 Offer 47. 礼物的最大价值
题目链接:https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/
1.思路
很明显的一道dp算法的,状态转移方程也很容易看出来
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];
//第一列赋值
for (int i = 1;i<m;i++){
dp[i][0] = dp[i-1][0] + grid[i][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++){
for (int j = 1;j<n;j++){
dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]) + grid[i][j];
}
}
return dp[m-1][n-1];
}
}