[leetcode: Python]198.House Robber

最新推荐文章于 2022-03-05 22:30:26 发布

AliceWanderAI

最新推荐文章于 2022-03-05 22:30:26 发布

阅读量636

点赞数

CC 4.0 BY-SA版权

分类专栏：算法文章标签： python leetcode

本文链接：https://blog.youkuaiyun.com/NXHYD/article/details/71715253

算法专栏收录该内容

150 篇文章

订阅专栏

本文探讨了一道经典的算法题目——房屋抢劫问题。该问题要求在不触发相邻房屋警报的前提下，计算出能够窃取的最大金额。文章提供了一种有效的动态规划解决方案，并给出了详细的实现代码。

摘要生成于 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.
题意：
给定一个非负整数数组表示一排房子。每个数表示房子里的金钱数。一个小偷要偷最多的钱，但是同时进入相邻的两个房子会引发警报。
求小偷能偷的钱最大值。

方法一：性能35ms

class Solution(object):
    def rob(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        ln = len(nums)
        retDp = [0 for each in nums]
        if ln == 0:
            return 0
        elif ln == 1:
            return nums[0]
        elif ln == 2:
            return max(nums[0], nums[1])
        else:
            retDp[0] = nums[0]
            retDp[1] = max(nums[0], nums[1])
            for i in range(2,ln):
                retDp[i] = max(retDp[i-1], retDp[i-2] + nums[i])
        return retDp[-1]