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:

     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:
    int rob(TreeNode* root) {
        pair<int,int> result=rob_node(root);
        return max(result.first,result.second);
    }
    
    pair<int,int> rob_node(TreeNode* root)
    {
        pair<int,int> result(0,0);
        if(root==NULL) return result;
        pair<int,int> rob_left=rob_node(root->left);
        pair<int,int> rob_right=rob_node(root->right);
        result.first=root->val+rob_left.second+rob_right.second;
        result.second=max(rob_left.first,rob_left.second)+max(rob_right.first,rob_right.second);
        return result;
    }
};