题目 :
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.
Example 1:
Input: [2,3,2] Output: 3 Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses.
Example 2:
Input: [1,2,3,1] Output: 4 Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3). Total amount you can rob = 1 + 3 = 4.
思路:
同上篇,区别在于,偷了第一个就不能偷最后一个,所以用两个小偷,第一个偷第一个到倒数第二个,第二个偷第二个到最后一个,比较取两者中最大金额
代码:
class Solution:
def rob(self, nums: List[int]) -> int:
if not nums:
return 0
if len(nums) < 3:
return max(nums)
rb1 = nums[0]
rb0 = 0
for i in range(1, len(nums)-1):
money = rb0
rb0 = max(rb1, rb0)
rb1 = money + nums[i]
res1 = max(rb0, rb1)
rb1 = nums[1]
rb0 = 0
for i in range(2, len(nums)):
money = rb0
rb0 = max(rb1, rb0)
rb1 = money + nums[i]
res2 = max(rb0, rb1)
return max(res1, res2)