337. 打家劫舍 III求解答

[taotie6]

337. 打家劫舍 III

[BerBai]

class Solution {
    Map<TreeNode, Integer> mem = new HashMap<>();
    public int rob(TreeNode root) {
        if(root==null) return 0;
        if(mem.containsKey(root)) return mem.get(root);

        int doVal = root.val + (root.left == null ? 0 : rob(root.left.left) + rob(root.left.right))
        + (root.right == null ? 0 : rob(root.right.left) + rob(root.right.right));
        int notDoVal = rob(root.left) + rob(root.right);
        int res = Math.max(doVal, notDoVal);
        mem.put(root, res);
        return res;
    }
}

[taotie6]

好的 谢谢