LeetCode 198. House Robber

青帆1998

于 2022-04-06 17:01:14 发布

阅读量206

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_43762534/article/details/123994526

LeetCode 专栏收录该内容

34 篇文章

订阅专栏

本文介绍了一位职业盗贼如何利用动态规划技巧，避开相邻房屋的安全系统，最大化在一个晚上能窃取的现金总额。通过理解不连续子序列最大和的原理，代码展示了如何计算给定金钱分布下避免报警的最大盗窃金额。

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

题目描述

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

解题思路

动态规划求解不连续子序列的最大和。使用数组 DP 存储已有的历史记忆，DP[i] 表示偷窃以 i 结尾的最大值。

代码

class Solution:
    def rob(self, nums: List[int]) -> int:
        n = len(nums)
        dp = [0] * n
        dp[0] = nums[0]
        for i in range(1, n):
            if i == 1:
                dp[i] = max(nums[0], nums[1])
            else:
                dp[i] = max(dp[:i - 1]) + nums[i]
        return max(dp)