LeetCode337 打家劫舍 III

题目

题目	解题
198. 打家劫舍	动态规划
213. 打家劫舍 II	动态规划
337. 打家劫舍 III	动态规划+深度优先搜索

解题

// javascript
var rob = function(root) {
    const f = new Map(); 
    const g = new Map();
    const dfs = (root) => {
        if (root === null) return;
        dfs(root.left);
        dfs(root.right);
        f.set(root, root.val + (g.get(root.left) || 0) + (g.get(root.right) || 0));
        g.set(root, Math.max(f.get(root.left) || 0, g.get(root.left) || 0) + Math.max(f.get(root.right) || 0, g.get(root.right) || 0));
    };
    dfs(root);
    return Math.max(f.get(root) || 0, g.get(root) || 0);
};

// javascript
var rob = function(root) {
    const dfs = (root) => {
        if (root === null) return [0, 0];
        const [lSelected, lNoSelected] = dfs(root.left);
        const [rSelected, rNoSelected] = dfs(root.right);
        const selected = root.val + lNoSelected + rNoSelected;
        const noSelected = Math.max(lSelected, lNoSelected) + Math.max(rSelected, rNoSelected);
        return [selected, noSelected];
    };
    const rootStatus = dfs(root);
    return Math.max(...rootStatus);
};