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:

Input: [3,2,3,null,3,null,1]

     3
    / \
   2   3
    \   \ 
     3   1

Output: 7 
Explanation: Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.
Example 2:

Input: [3,4,5,1,3,null,1]

     3
    / \
   4   5
  / \   \ 
 1   3   1

Output: 9
Explanation: Maximum amount of money the thief can rob = 4 + 5 = 9.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/house-robber-iii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

思路：

1、两种情况，一种是抢根节点的值root->val + A为根节点不抢根节点的rob结果 + B为根节点不抢根节点的rob值；另一种是不抢根节点，抢A结点子树的rob结果+抢B结点子树的rob结果

/**
 * 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 max(int a, int b){
        return a > b? a : b;
    }
    
    int rob(TreeNode* root) {
       if(root == NULL) return 0;
        int ll = 0, lr = 0, rl = 0, rr = 0;
        int left, right;
        //不抢root
        left = rob(root->left);
        right = rob(root->right);
        //抢了root
        if(root->left){
            if(root->left->left){
                ll = root->left->left->val;
            }
            if(root->left->right){
                lr = root->left->right->val;
            }
        }
        if(root->right){
            if(root->right->left){
                rl = root->right->left->val;
            }
            if(root->right->right){
                rr = root->right->right->val;
            }
        }
        root->val = max(root->val+ll+lr+rl+rr,left+right);
        return root->val;
    }  
};