leetcode 213. House Robber II

class Solution(object):    def rob(self, nums):        """        :type nums: List[int]        :rtype: int        """        length = len(nums)        if length < 2:            return nums[0] if length else 0        return max(self.subProcess(nums,0,length-1),self.subProcess(nums,1,length))                        def subProcess(self,nums,left,right):        pre = 0        cur = 0        for i in range(left,right):            cur,pre = max(pre+nums[i],cur),cur        return cur