每日一道Leetcode - 剑指 Offer 47. 礼物的最大价值【动态规划】

奋进的杰西

于 2021-06-13 13:49:14 发布

阅读量68

点赞数

分类专栏： Leetcode 文章标签： python

本文链接：https://blog.youkuaiyun.com/weixin_41041275/article/details/117875409

版权

Leetcode 专栏收录该内容

304 篇文章

订阅专栏

在这里插入图片描述

class Solution:
    def maxValue(self, grid: List[List[int]]) -> int:
        m = len(grid)
        n = len(grid[0])
        dp = [[0]*(n) for _ in range(m)]
        for i in range(m):
            for j in range(n):
                if i==0 and j==0:
                    dp[i][j] = grid[0][0]
                elif i == 0:
                    dp[i][j] = dp[i][j-1]+grid[i][j]
                elif j == 0:
                    dp[i][j] = dp[i-1][j]+grid[i][j]
                else:
                    dp[i][j] = max(dp[i-1][j],dp[i][j-1])+grid[i][j]
        return dp[m-1][n-1]