在一个 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来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
python
class Solution(object):
def maxValue(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
m = len(grid)
n = len(grid[0])
if m == 0 or n == 0: return 0
dp = [[0]*201 for i in range(201)]
dp[0][0] = grid[0][0]
for i in range(m):
for j in range(n):
if i == 0 and j == 0:continue
if i == 0: dp[i][j] = grid[i][j] + dp[i][j-1]
elif j == 0: dp[i][j] = grid[i][j] + dp[i-1][j]
else:
dp[i][j] = grid[i][j] + max(dp[i][j-1],dp[i-1][j])
return dp[m-1][n-1]
# 1.python创建二维List l = [[0]*3 for i in range(4)]
# 2.python range(3)即:从0到3,不包含3,即0,1,2
c++
class Solution {
public:
int maxValue(vector<vector<int>>& grid) {
int dp[201][201];
int m=grid.size();
int n=grid[0].size();
if(m==0||n==0)return 0;
dp[0][0] = grid[0][0];
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
if(i==0&&j==0)continue;
if(i==0)dp[i][j]=grid[i][j]+dp[i][j-1];
else if(j==0)dp[i][j]=grid[i][j]+dp[i-1][j];
else dp[i][j]=grid[i][j] + max(dp[i-1][j], dp[i][j-1]);
}
}
return dp[m-1][n-1];
}
};