[leetcode] 337. House Robber III

Question:

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.

Solution:

基本思路是，对于每个节点，抢这个节点则为不抢左右节点+该节点的值，不抢则为左右节点最大值之和。

计算每个节点需要知道孩子节点的信息，因此可以用后序遍历。

/**
 * 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 rob(TreeNode* root) {
        auto p = helper(root);
        return max(p[0], p[1]);
    }

    vector<int> helper(TreeNode* root) {
        if (!root)
            return vector<int>(2, 0);
        auto l = helper(root->left), r = helper(root->right);
        // 0 no, 1 rob
        vector<int> v;
        v.push_back( max(l[0], l[1]) + max(r[0], r[1]) );
        v.push_back( (l[0] + r[0]) + root->val);
        return v;
    }
};