Python | Leetcode Python题解之第213题打家劫舍II

题目：

题解：

class Solution:def rob(self, nums: List[int]) -> int:def robRange(start: int, end: int) -> int:first = nums[start]second = max(nums[start], nums[start + 1])for i in range(start + 2, end + 1):first, second = second, max(first + nums[i], second)return secondlength = len(nums)if length == 1:return nums[0]elif length == 2:return max(nums[0], nums[1])else:return max(robRange(0, length - 2), robRange(1, length - 1))