题解:
代码:
/**
* * 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:
std::unordered_map<TreeNode*, int> table;
int rob(TreeNode* root) {
if(!root) {
return 0;
}
// 记忆化搜索
if(table.find(root) != table.end()) {
return table[root];
}
// max2是不包含root的最大值
int left = rob(root->left);
int right = rob(root->right);
int max2 = left + right;
// max1是包含root的最大值
int max1 = root->val;
if(root->left) {
max1 += rob(root->left->left) + rob(root->left->right);
}
if(root->right) {
max1 += rob(root->right->left) + rob(root->right->right);
}
// 记录以root为根的最大值
table[root] = max(max2, max1);
return table[root];
}
};