(day 39 - 动态规划) 剑指 Offer 47. 礼物的最大价值

题目

题链：剑指 Offer 47. 礼物的最大价值

题解

看到题呢题目说要用动态规划、我用了dfs去解果不其然超时了。

class Solution {
    private int maxValue = 0;

    public int maxValue(int[][] grid) {
        dfs(grid,0,0,0);
        return maxValue;

    }

    void dfs(int[][] grid,int r,int l,int cur){
        if (r == (grid[0].length-1) && l == (grid.length-1)){
            if (cur+grid[l][r] > maxValue){
                maxValue = cur+grid[l][r];
                return;
            }
        }
        if (r + 1 < grid[0].length){
            dfs(grid,r+1,l,cur + grid[l][r]);
        }
        if (l + 1 < grid.length){
            dfs(grid,r,l+1,cur + grid[l][r]);
        }
    }
}

所以还是要用动态规划的方法去解
因为只有向下或者向右所以设某节点的最大值为dp(i,j)，很显然dp(i,j) = max( dp(i-1,j) + dp(i,j-1) ) + grid[i][j]，所以可得递推式为f(i,j) = max( f(i-1,j) + dp(i,j-1) ) + grid[i][j]。
特殊情况有不是中间节点的在最顶层或者最右层的。
总的递推式：
i=0,j=0 为开始元素 grid(i,j)
i>0,j=0 为最左边元素 dp[i][j] = dp[i-1][j] + grid[i][j]
i=0,j>0 为最上边元素 dp[i][j] = dp[i][j-1] + grid[i][j]
i>0,j>0 为中间元素 dp[i][j] = max(dp[i][j-1] 、dp[i-1][j]) + grid[i][j]
所以可得代码

class Solution {
    public int maxValue(int[][] grid) {
        int r = grid.length,l = grid[0].length;
        int dp[][] = new int[r][l];
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < l; j++) {
                if (i == 0 && j == 0){ dp[i][j] = grid[i][j]; }
                else if (i > 0 && j == 0){ dp[i][j] = dp[i-1][j] + grid[i][j];}
                else if (i == 0 && j > 0){ dp[i][j] = dp[i][j-1] + grid[i][j];}
                else { dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]) + grid[i][j]; }
            }
        }
            
        return dp[r-1][l-1];
    }
}

实际上dp只和dp[i-1][j]、dp[i][j-1]、grid[i][j]有关系、所以可以直接在原数组上操作。就可以将空间复杂度由M*N降为1。

class Solution {
    public int maxValue(int[][] grid) {
        int r = grid.length,l = grid[0].length;
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < l; j++) {
                if (i > 0 && j == 0){ grid[i][j] = grid[i-1][j] + grid[i][j];}
                else if (i == 0 && j > 0){ grid[i][j] = grid[i][j-1] + grid[i][j];}
                else if (i > 0 && j > 0){ grid[i][j] = Math.max(grid[i-1][j],grid[i][j-1]) + grid[i][j]; }
            }
        }
        return grid[r-1][l-1];
    }
}