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:

     3
    / \
   2   3
    \   \ 
     3   1

Maximum amount of money the thief can rob =  3  +  3  +  1  =  7 .

Example 2:

     3
    / \
   4   5
  / \   \ 
 1   3   1

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

class Solution {
public:
    vector<int> dfs(TreeNode *root)
    {
        vector<int> res(2,0);
        if(!root) return res;
        if(root->left)
        {
            vector<int> temp = dfs(root->left);
            res[0] += max(temp[0], temp[1]);
            res[1] += temp[0];
        }
        
        if(root->right)
        {
            vector<int> temp = dfs(root->right);
            res[0] += max(temp[0], temp[1]);
            res[1] += temp[0];
        }
        res[1] += root->val;
        return res;
    }
    
    int rob(TreeNode* root) {
        if(!root) return 0;
        vector<int> temp = dfs(root);
        return max(temp[0], temp[1]);
    }
};