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.

dfs。对于任何一个节点，有两种选择，要么偷自己并且选择偷儿子的儿子，要么只偷自己儿子，两者取一个最大值。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int rob(TreeNode* root) {
        if(root == NULL)return 0;
        int val = 0;

        if(root->left)
            val += robhelp(root->left->left, m) + robhelp(root->left->right, m);
        if(root->right)
            val += robhelp(root->right->left, m) + robhelp(root->right->right, m);

        //printf("%d ", val);
        // max(偷自己+4个孙子们的， 偷俩儿子的)
        return max(root->val + val, robhelp(root->left, m) + robhelp(root->right, m));;

    }
};

但是这样呢，实在是太慢了。由于max(偷自己+4个孙子们的， 偷俩儿子的)这里偷了6次，递归一下，孙子们的和儿子们的又需要重复计算。因此，打表记录一下，可以节省大量的计算，这也是动态规划。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int rob(TreeNode* root) {
        map<TreeNode*, int> m;
        return robhelp(root, m);

    }

    int robhelp(TreeNode* root, map<TreeNode*, int>& m)//这里必须引用，否则爸爸查不到儿子们和孙子们的，反而会超时
    {
        if(root == NULL)return 0;
        if(m.find(root) != m.end())
            return m[root];
        int val = 0;

        if(root->left)
            val += robhelp(root->left->left, m) + robhelp(root->left->right, m);
        if(root->right)
            val += robhelp(root->right->left, m) + robhelp(root->right->right, m);

        //printf("%d ", val);
        m[root] = max(root->val + val, robhelp(root->left, m) + robhelp(root->right, m));
        return m[root];
    }
};