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.
Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

Subscribe to see which companies asked this question
DFS，给每个结点增加一个两元素的数组。res[0] 表示不加上当前结点值的最大值，res[1] 表示加上当前结点值的最大值。那么对于 res[0] 来说，其值等于子结点数组元素的较大值，因为此时可以加上子结点，也可以不加上子结点，选其中较大值。但是对于 res[1] 来说，就不行了，因为加上当前结点值的时候，必须不能加上子结点的值，否则警报会响，因此，只能算上子结点的 res[0]。代码如下：

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]);
    }

代码二：

int rob(TreeNode* root) {
        return robDFS(root).second;
    }
    pair<int, int> robDFS(TreeNode* node){
        if( !node) return make_pair(0,0);
        auto l = robDFS(node->left);
        auto r = robDFS(node->right);
        int f2 = l.second + r.second;
        int f1 = max(f2, l.first + r.first + node->val);
        return make_pair(f2, f1);
    }