LeetCode *** 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.

分析：

利用递归即可。但是中间有很多重复量。。。没记录下之前的结果的代码用了1116ms。。。。

代码：

28ms

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

1116ms

/**
 * 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;
        if(root!=NULL&&(root->left==NULL&&root->right==NULL))return root->val;
        
        int i1=root->val;
        int i2=0;
        if(root->left!=NULL){
            if(root->left->left!=NULL)i1+=rob(root->left->left);
            if(root->left->right!=NULL)i1+=rob(root->left->right);
            i2+=rob(root->left);
        }
        if(root->right!=NULL){
            if(root->right->left!=NULL)i1+=rob(root->right->left);
            if(root->right->right!=NULL)i1+=rob(root->right->right);
            i2+=rob(root->right);
        }
        
        return max(i1,i2);
    }
};