Leetcode-213. House Robber II 打家劫舍 II （DP）

题目

你是一个专业的小偷，计划偷窃沿街的房屋，每间房内都藏有一定的现金。这个地方所有的房屋都围成一圈，这意味着第一个房屋和最后一个房屋是紧挨着的。同时，相邻的房屋装有相互连通的防盗系统，如果两间相邻的房屋在同一晚上被小偷闯入，系统会自动报警。
给定一个代表每个房屋存放金额的非负整数数组，计算你在不触动警报装置的情况下，能够偷窃到的最高金额。
链接：https://leetcode.com/problems/house-robber-ii/

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, 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.

Example:

Input: [2,3,2]
Output: 3
Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses.

思路及代码

DP 1.

• 分别去掉第一家和最后一家，各算一遍最大值
• curr = max(prev, temp+nums[i])， 同198. 打家劫舍

# 28ms 81.24%
class Solution:
    def rob(self, nums: List[int]) -> int:
        if not nums:
            return 0
        n = len(nums)
        if n == 1:
            return nums[0]
        # 分别去掉第一家和最后一家，各算一遍最大值
        # 去掉第一家
        prev = curr = 0
        for i in range(1, n):
            temp = prev
            prev = curr
            curr = max(prev, temp+nums[i])
        max_nofirst = curr
        # 去掉最后一家
        prev = curr = 0
        for i in range(n-1):
            temp = prev
            prev = curr
            curr = max(prev, temp+nums[i])
        max_nolast = curr
        # 返回两者最大值
        return max(max_nofirst, max_nolast)
        

复杂度

T = $O(n)$
S = $O(1)$