📃 题目描述

题目链接：剑指 Offer 47. 礼物的最大价值 (opens new window)

🔔 解题思路

和上一题 剑指 Offer II 100. 三角形中最小路径之和 - 力扣（LeetCode） (opens new window) 基本一致

class Solution {
    public int maxValue(int[][] grid) {
        if (grid == null || grid[0].length == 0 || grid.length == 0) {
            return 0;
        }

        int row = grid.length;
        int col = grid[0].length;

        int[][] dp = new int[row][col];
        dp[0][0] = grid[0][0];
        // base case
        for (int i = 1; i < row; i ++) {
            dp[i][0] = dp[i - 1][0] + grid[i][0];
        }
        for (int i = 1; i < col; i ++) {
            dp[0][i] = dp[0][i - 1] + grid[0][i];
        }

        for (int i = 1; i < row; i ++) {
            for (int j = 1; j < col; j ++) {
                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
            }
        }

        int res = 0;
        for (int i = 0; i < col; i ++) {
            res = Math.max(res, dp[row - 1][i]);
        }

        return res;
    }
}

💥 复杂度分析

• 空间复杂度：
• 时间复杂度：