LeetCode（198）——House Robber

最新推荐文章于 2021-08-05 11:16:28 发布

原创最新推荐文章于 2021-08-05 11:16:28 发布 · 119 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode题库专栏收录该内容

6 篇文章

订阅专栏

本文探讨了一种算法问题，即如何在不触动相邻房屋警报系统的情况下，从一系列房屋中获取最大金额的抢劫策略。通过动态规划的方法，我们详细解析了如何计算出最佳抢劫路径，确保了最大化的收益。

摘要生成于 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 system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.
思路：
考察动态规划
代码：

class Solution(object):
    def rob(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:
            return 0
        if len(nums) <= 2:
            return max(nums)
        f = [0]*len(nums)
        f[0] = nums[0]
        f[1] = max(nums[0],nums[1])
        for i in range(2,len(nums)):
            f[i] = max(f[i-1], f[i-2]+nums[i])
        return f[-1]

其他方法（？）：

class Solution:
    def rob(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        prev, cur = 0, 0
        for value in nums:
            prev, cur = cur, max(prev + value, cur)
        return cur

参考：https://blog.youkuaiyun.com/fuxuemingzhu/article/details/51291936
2019.2.27 武汉