# Middle-题目129：337. House Robber III（增补1）

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.

profit[0]=leftProfit[1]+rightProfit[1]+root.val;$profit[0] = leftProfit[1] + rightProfit[1] + root.val;$
profit[1]=Math.max(leftProfit[0],leftProfit[1])+Math.max(rightProfit[0],rightProfit[1]);$profit[1] = Math.max(leftProfit[0],leftProfit[1]) + Math.max(rightProfit[0], rightProfit[1]);$

public class Solution {
public int rob(TreeNode root) {
int[] profit = dfs(root);
return Math.max(profit[0], profit[1]);
}
private int[] dfs(TreeNode root) {
int[] profit = new int[2];
// profit[0] stands for the maximum profit with robbing root, while profit[1] stands for the maximum profit without robbing root.
if(root!=null) {
int[] leftProfit = dfs(root.left);
int[] rightProfit = dfs(root.right);
profit[0] = leftProfit[1] + rightProfit[1] + root.val;
profit[1] = Math.max(leftProfit[0],leftProfit[1]) + Math.max(rightProfit[0], rightProfit[1]);
return profit;
}
return new int[2];
}
}

1ms（统计信息还未显示）
Cmershen的碎碎念：

03-12 2700

03-27 980

03-13 5078

03-23 1266

11-05 774

06-01 2036

09-14 84

04-30 635

03-08 1215

01-05 388