剑指 Offer 47. 礼物的最大价值-CSDN博客

本文链接：https://blog.csdn.net/oykotxuyang/article/details/108006473

/*class Solution {
public:
    //超时:时间O(m * n)(m, n分别为矩阵的第一维和第二维的长度)，空间O(1)
    int res = 0;
    int maxValue(vector<vector<int>>& grid) {
        int len1 = grid.size();
        if(len1 == 0) return 0;
        int len2 = grid[0].size();
        if(len2 == 0) return 0;
        helper(grid, 0, 0, 0);
        return res; 
    }
private:
    void helper(vector<vector<int>>& grid, int row, int col, int total) {
        if(row == grid.size() - 1 && col == grid[0].size() - 1) {
            total += grid[row][col];
            res = max(res, total);
            return ;
        }
        total += grid[row][col];
        if(row < grid.size() - 1) {
            helper(grid, row + 1, col, total);
        }
        if(col < grid[0].size() - 1) {
            helper(grid, row, col + 1, total);
        }
    }
};*/

class Solution {
public:
    //动态规划
    //dp[i][j]:表示以grid[i][j]为终点的礼物最大价值，
    //dp[i][j] = max(dp[i - 1][j] + dp[i][j - 1]) + grid[i][j]
    int maxValue(vector<vector<int>>& grid) {
        int len1 = grid.size();
        if(len1 == 0) return 0;
        int len2 = grid[0].size();
        if(len2 == 0) return 0;
        vector<vector<int>> dp(len1, vector<int>(len2, 0));
        dp[0][0] = grid[0][0];
        for(int i = 1; i < len1; i++) {
            dp[i][0] = dp[i - 1][0] + grid[i][0];
        }
        for(int i = 1; i < len2; i++) {
            dp[0][i] = dp[0][i - 1] + grid[0][i];
        }
        for(int i = 1; i < len1; i++) {
            for(int j = 1; j < len2; j++) {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
            }
        }
        return dp[len1 - 1][len2 - 1];
    }
};