[leetcode] 213. House Robber II @ python

原题

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 1:

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.
Example 2:

Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.

解法

参考: Python | 图文分析 - 公瑾™
动态规划, 关键是推导状态转移方程. 设f(i)为在index i 时最多能偷到的钱

f(0) = nums[0]
f(1) = max(nums[0], nums[1])
f(i) = max(f(i-1), f(i-2) + nums[i])

由于房子是环状的, 不可以同时偷第一个和最后一个房子, 那么我们分开计算不偷第一个房子和不偷最后一个房子时能偷到的钱, 然后取较大值即可.
Time: O(n)
Space: O(1)

代码

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)
        return max(self.rob_row(nums[1:]), self.rob_row(nums[:-1]))        
        
    def rob_row(self, nums):        
        money = [0]*len(nums)
        money[0] = nums[0]
        money[1] = max(nums[0], nums[1])
        for i in range(2, len(nums)):
            money[i] = max(money[i-1], money[i-2] + nums[i])
        return money[-1]