Leetcode之 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:

Input: [3,2,3,null,3,null,1]

     3
    / \
   2   3
    \   \ 
     3   1

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

Example 2:

Input: [3,4,5,1,3,null,1]

     3
    / \
   4   5
  / \   \ 
 1   3   1

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

代码：

/**
 * 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:
    map<TreeNode*,int> m;
    int rob(TreeNode* root) {
        if (!root)return 0;
        if(m.count(root))return m[root];
	int val1 = root->val, val2 = rob(root->left)+rob(root->right);
	if (root->left) {
		val1 += rob(root->left->left) + rob(root->left->right);
		
	}
	if (root->right) {
		val1 += rob(root->right->left) + rob(root->right->right);
		
	}
    m[root]=max(val1,val2);
	return m[root];
    }
};

想法：记忆化搜索