LeetCode 剑指Offer 47 礼物的最大价值

题目

解题

解题一：记忆化搜索

// javascript
var maxValue = function(grid) {
    const m = grid.length, n = grid[0].length;
    const record = new Map();
    const dfs = (grid, i, j) => {
        if (i === m || j === n) return 0;
        if (record.has(i + '-' + j) === false) {
            let sum = grid[i][j];
            const moveDownValue = dfs(grid, i + 1, j);
            const moveRightValue = dfs(grid, i, j + 1);
            record.set(i + '-' + j, sum + Math.max(moveDownValue, moveRightValue));
        }
        return record.get(i + '-' + j);
    }
    return dfs(grid, 0, 0);
};

解题二：动态规划

二维 dp：

// javascript
var maxValue = function(grid) {
    const m = grid.length, n = grid[0].length;
    const dp = new Array(m).fill(0).map(() => new Array(n).fill(0));
    for (let i = 0; i < m; ++i) {
        for (let j = 0; j < n; ++j) {
            if (i === 0 && j === 0) dp[i][j] = grid[i][j];
            else if (i === 0) dp[i][j] = dp[i][j - 1] + grid[i][j];
            else if (j === 0) dp[i][j] = dp[i - 1][j] + grid[i][j];
            else dp[i][j] = Math.max(dp[i][j - 1], dp[i - 1][j]) + grid[i][j];
        }
    }
    return dp[m - 1][n - 1];
};

一维 dp：

// javascript
var maxValue = function(grid) {
    const m = grid.length, n = grid[0].length;
    const dp = new Array(n).fill(0);
    for (let i = 0; i < m; ++i) {
        for (let j = 0; j < n; ++j) {
            if (i === 0 && j === 0) dp[j] = grid[i][j];
            else if (i === 0) dp[j] = dp[j - 1] + grid[i][j];
            else if (j === 0) dp[j] = dp[j] + grid[i][j];
            else dp[j] = Math.max(dp[j - 1], dp[j]) + grid[i][j];
        }
    }
    return dp[n - 1];
};

解题三：将原矩阵用作 dp 矩阵

参考：面试题47. 礼物的最大价值（动态规划，清晰图解）

// javascript
var maxValue = function(grid) {
    const m = grid.length, n = grid[0].length;
    for (let i = 0; i < m; ++i) {
        for (let j = 0; j < n; ++j) {
            if (i === 0 && j === 0) continue;
            else if (i === 0) grid[i][j] += grid[i][j - 1];
            else if (j === 0) grid[i][j] += grid[i - 1][j];
            else grid[i][j] += Math.max(grid[i][j - 1], grid[i - 1][j]);
        }
    }
    return grid[m - 1][n - 1];
};

或者把第一行和第一列提到外面先处理：

// javascript
var maxValue = function(grid) {
    const m = grid.length, n = grid[0].length;
    for (let i = 1; i < m; ++i) grid[i][0] += grid[i - 1][0];  // 处理第一列
    for (let j = 1; j < n; ++j) grid[0][j] += grid[0][j - 1];  // 处理第一行
    for (let i = 1; i < m; ++i) {
        for (let j = 1; j < n; ++j) {
            grid[i][j] += Math.max(grid[i][j - 1], grid[i - 1][j]);
        }
    }
    return grid[m - 1][n - 1];
};