337. House Robber III

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that "all houses in this place forms a binary tree". It will automatically contact the police if two directly-linked houses were broken into on the same night.

Determine the maximum amount of money the thief can rob tonight without alerting the police.

Example 1:

     3
    / \
   2   3
    \   \ 
     3   1

Maximum amount of money the thief can rob =  3  +  3  +  1  =  7 .

Example 2:

     3
    / \
   4   5
  / \   \ 
 1   3   1

Maximum amount of money the thief can rob = 4 + 5 = 9.

利用hashmap储存中间计算的值

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    Map <TreeNode, Integer> map = new HashMap<>();
    public int rob(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int rootSum = sum(root);
        int leftSum = rob(root.left);
        int rightSum = rob(root.right);
        if (rootSum > (leftSum + rightSum)) {
            return rootSum;
        }
        else {
            return (leftSum + rightSum);
        }
    }
    
    private int sum(TreeNode node) {
        if (map.containsKey(node)) {
            return map.get(node);
        }
        if (node == null) {
            return 0;
        }
        int sumLeft = 0, sumRight = 0;
        if(node.left != null) {
            sumLeft = rob(node.left.left) + rob(node.left.right);
        }
        if (node.right != null) {
            sumRight = rob(node.right.left) + rob(node.right.right);
        }
        int val = node.val + sumLeft + sumRight;
        map.put(node, val);
        return val;
    }
        /*int res = helper(root);
        return Math.max(res[0], res[1]);
    }
    private int[] helper(TreeNode root) {
        if (root == null){
            return new int[2];
        }
        int[] left = helper(root.left);
        int[] right = helper(root.right);
        int[] res = new int[2];
        res[0] = Math.max(left[0], left[1]) + Math.max(right[0], right[1]);
        res[1] = root.val 
    }*/
}