/**
* 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:
void visit(TreeNode* root,int &u,int &a){
if(!root)
{
u=a=0;
return;
}
int u1,u2,a1,a2;
visit(root->left,u1,a1);
visit(root->right,u2,a2);
a=root->val+u1+u2;
u=max(a1,u1)+max(a2,u2);
return;
}
int rob(TreeNode* root) {
int u,a;
visit(root,u,a);
return max(u,a);
}
};
leetcode - 337. House Robber III
最新推荐文章于 2024-09-02 07:40:27 发布