LeetCode 337. House Robber III

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:

Input: [3,2,3,null,3,null,1]
     3
    / \
   2   3
    \   \ 
     3   1
Output: 7 
Explanation: Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.

Example 2:

Input: [3,4,5,1,3,null,1]
     3
    / \
   4   5
  / \   \ 
 1   3   1
Output: 9
Explanation: Maximum amount of money the thief can rob = 4 + 5 = 9.

 

思路：

同是动态规划，难度有点大

1. 假设无节点，则返回0

2. 假设有了根节点，要么偷，要么不偷，如果不偷，那么notrobbed初始化为0，如果偷，则robbed += root.val

3. 接下来，假设是一个树，有根节点，有叶子，则遍历左右叶子，假设上个节点没偷，则notrobbed += leftrobbed，如果上个节点偷了，那么这一轮就不能偷了，此时小偷能拿到的最多的钱是上一轮偷得加上这一轮不偷的，和上一轮不偷的前的最大值：robbed = max(robbed + leftnotrobbed, notrobbed)，而本节点偷与不偷，与上一轮是一个算法，右侧叶子同理

代码：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def rob(self, root: TreeNode) -> int:
        if not root:
            return 0
           
        def robhelper(root):
            robbed = 0
            notrobbed = 0
            if root:
                robbed += root.val
                if root.left:
                    leftnotrobbed, leftrobbed = robhelper(root.left)
                    notrobbed += leftrobbed
                    robbed = max(robbed + leftnotrobbed, notrobbed)  
                if root.right:
                    rightnotrobbed, rightrobbed = robhelper(root.right)
                    notrobbed += rightrobbed
                    robbed = max(robbed + rightnotrobbed, notrobbed) 
            return notrobbed, robbed
        return max(robhelper(root))