【LeetCode】337. 打家劫舍 III

/**
 * 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 {
    struct nums{
        int rob=0;
        int norob=0;
    };
public:
    int rob(TreeNode* root) {
        nums n = dp(root);
        return max(n.rob,n.norob);
    }
    nums dp(TreeNode * root){
        nums n;
        if(root == NULL)return n;
        nums left = dp(root->left);
        nums right = dp(root->right);
        n.rob = root->val+ left.norob+ right.norob;
        n.norob = max(left.rob,left.norob)+max(right.rob,right.norob);
        return n;
    }
};