LEETCODE 剑指 Offer 47. 礼物的最大价值

动态规划：

每次f[i][j]为当前值和上一步值的较大者，然后更新当前的f[i][j]

class Solution:
    def maxValue(self, grid: List[List[int]]) -> int:
        m, n = len(grid), len(grid[0])
        f = [[0] * n for _ in range(m)]

        for i in range(m):
            for j in range(n):
                if i > 0:
                    f[i][j] = max(f[i][j], f[i - 1][j])
                if j > 0:
                    f[i][j] = max(f[i][j], f[i][j - 1])
                f[i][j] += grid[i][j]
        
        return f[m - 1][n - 1]