[LeetCode] 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.
Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.
这道题是之前那两道House Robber II和House Robber的拓展,这个小偷又偷出新花样了,沿着二叉树开始偷,碉堡了,题目中给的例子看似好像是要每隔一个偷一次,但实际上不一定只隔一个,比如如下这个例子:
4
/
1
/
2
/
3
其实思路就是: 从根节点开始依次递归,递归结束之后,返回的就是最大结果。 对于每个节点进行的递归,最大值考虑题目所述两种情况。1 就是本节点和间隔一层的两个节点*(前提条件是判断存不存在子节点) 2 就是两个子节点
rob函数的理解就是当前节点进行比较之后的到的最大值
class Solution {
public int rob(TreeNode root) {
if(root == null)
return 0;
int val1 = root.val;
if(root.left != null)
val1 += rob(root.left.left) + rob(root.left.right);
if(root.right != null)
val1 += rob(root.right.left) + rob(root.right.right);
int val2 = rob(root.left) + rob(root.right);
return Math.max(val1, val2);
}
}