leetcode(剑指offer47)-礼物的最大价值(dp法,学习二维数组)

二维数组

详见简书https://www.jianshu.com/p/c11535546e2c

和机器人走矩阵题目一样，问题不一样本题求最值，那题求sum。
那题：

这道题：
难点：i,j 为0等等的边界值！！！！
m,n = len(grid),len(grid[0])

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