# LeetCode 刷题笔记 之 House Robber III

xiaoxiao2021-02-28  3

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) { return dfs(root); } private int[] dfs(TreeNode root) { int[] rob ={0, 0}; if(root != null) { int[] robLeft = dfs(root.left); int[] robRight = dfs(root.right); rob = robLeft + robRight; //左子树的最大值，右子树的最大值 rob = Math.max(robLeft + robRight + root.val, rob); //要么是子树层，要么是本层+子树的子树层。 } return rob; } }