leetcode 213. 打家劫舍 II python

题目描述：

题解：

参考leetcode评论区

 直接使用leetcode198 的代码

class Solution(object):
    def rob(self, nums):
        if len(nums)==1:
            return nums[0]
        nums1 = nums[0:len(nums)-1]
        nums2 = nums[1:len(nums)]
        return max(self.linerob(nums1),self.linerob(nums2))
    def linerob(self, nums):
        number = len(nums)
        dp = [0 for i in range(number+1)]
        dp[number-1] = nums[number-1]
        for i in range(number-2,-1,-1):
            dp[i] = max(dp[i+1],dp[i+2]+nums[i])
        return dp[0]