抢劫问题（房屋构造为树）House Robber III

最新推荐文章于 2020-04-16 02:04:19 发布

weixin_34376562

最新推荐文章于 2020-04-16 02:04:19 发布

阅读量121

点赞数

文章标签： python

原文链接：https://my.oschina.net/liyurong/blog/1594908

版权

2019独角兽企业重金招聘Python工程师标准>>>

问题：

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 smart thief realized that "all h has one and only one parent house. After a tour, theouses 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:

Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.

Example 2:

Maximum amount of money the thief can rob = 4 + 5 = 9.

解决：

【注意】题目中给的例子看似好像是要每隔一个偷一次，但实际上不一定只隔一个。

① 递归地遍历树。我们可以使用一个数组来保持2个值：当一个根被选择时的最大金额，当没有被选择时是一个根时的最大值。其中res[0]表示不包含当前节点值的最大值，res[1]表示包含当前值的最大值，那么我们在遍历某个节点时，首先对其左右子节点调用递归函数，分别得到包含与不包含左子节点值的最大值，和包含与不包含右子节点值的最大值，那么当前节点的res[0]就是左子节点两种情况的较大值加上右子节点两种情况的较大值，res[1]就是不包含左子节点值的最大值加上不包含右子节点值的最大值，和当前节点值之和，返回即可。

class Solution { //1ms
public int rob(TreeNode root) {
if (root == null) return 0;
int[] res = dfs(root);
return Math.max(res[0],res[1]);
}
public int[] dfs(TreeNode root){
if (root == null){
int[] res = {0,0};
return res;
}
int[] res = new int[2];
int[] left = dfs(root.left);
int[] right = dfs(root.right);
res[0] = root.val + left[1] + right[1];
res[1] = Math.max(left[0],left[1]) + Math.max(right[0],right[1]);
return res;
}
}