House Robber II.py

class Solution:
    def rob(self, nums: List[int]) -> int:
        def calc(nums):
            if len(nums) == 0:
                return 0
            elif len(nums) == 1:
                return nums[0]
            dp = [0]*len(nums)
            dp[0] = nums[0]
            dp[1] = max(nums[0], nums[1])
            for i in range(2,len(nums)):
                dp[i] = max(dp[i-2] + nums[i], dp[i-1])
            return dp[-1]
        if len(nums) == 0:
            return 0
        elif len(nums) == 1:
            return nums[0]
        return max(calc(nums[1:]),calc(nums[:-1]))