原题链接
实现原理解析
该题在House Robber的基础上让首位链接形成环,那么即表示第一个和最后一个不能同时被抢,则问题分解为House Robber(nums[0:len(nums)-1])和House Robber(nums[1:len(nums)]),两者中比较大的那个即为结果
python代码实现
class Solution(object):
def rob(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
length = len(nums)
if length == 0:
return 0
elif length == 1:
return nums[0]
elif length ==2:
return max(nums[0], nums[1])
return max(self.dfs(nums[1:]), self.dfs(nums[:-1]))
def dfs(self, nums):
if len(nums) == 2:
return max(nums[0], nums[1])
res = [0 for each in nums]
res[0] = nums[0]
res[1] = max(nums[0], nums[1])
for index in xrange(2,len(nums)):
res[index] = max(res[index -2] + nums[index], res[index - 1])
return res[len(nums) - 1]