LeetCode in Python 337. House Robber III

最新推荐文章于 2025-08-11 22:22:04 发布

weixin_30624825

最新推荐文章于 2025-08-11 22:22:04 发布

阅读量113

点赞数

CC 4.0 BY-SA版权

文章标签： python

原文链接：http://www.cnblogs.com/lowkeysingsing/p/11273415.html

本文探讨了一个智能窃贼如何在一个形如二叉树的社区中，通过精心设计的算法来最大化其掠夺金额，同时避免触发报警系统。文章详细解释了递归与记忆化搜索的方法，确保相邻房屋不会在同一晚被侵入。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

只能隔层偷，如果直连的两层被盗就报警。用map[root]表示从root出发能偷的最大数（可能包含root，也可能不包含root），分两种情况计算。用map存结果避免反复递归。

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

class Solution(object):
    def rob(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        m = {}
        
        def memorized(root):
            if not root: return 0
            if m.has_key(root): return m[root]
            
            oneStep = memorized(root.left) + memorized(root.right)
            twoSteps = 0
            if root.left:
                twoSteps += (memorized(root.left.left) + memorized(root.left.right))
            if root.right:
                twoSteps += (memorized(root.right.left) + memorized(root.right.right))
            
            m[root] = max((root.val + twoSteps), oneStep)
            return m[root]
        
        return memorized(root)

转载于:https://www.cnblogs.com/lowkeysingsing/p/11273415.html