(1)后序遍历,类似二叉树的公共祖先
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
private:
unordered_map<TreeNode*,int> f,g;
public:
void helper(TreeNode *root) {
if(!root) {
f[root]=0;
g[root]=0;
return;
}
helper(root->left);
helper(root->right);
f[root]=g[root->left]+g[root->right]+root->val;
g[root]=max(f[root->left],g[root->left])+max(f[root->right],g[root->right]);
return;
}
int rob(TreeNode* root) {
helper(root);
return max(f[root],g[root]);
}
};