题目:
Note: This is an extension of House Robber.
After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place arearranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, the security system for these houses remain the same as for those in the previous street.
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonightwithout alerting the police.
题解:
因为是个圈,所以针对最后一所房子需要重新计算一次。
C++版:
class Solution {
public:
int rob(vector<int>& nums) {
if(nums.size() == 0)
return 0;
if(nums.size() == 1)
return nums[0];
int global = 0;
vector<int> robs1(nums.size(), 0);
vector<int> robs2(nums.size(), 0);
for(int i = 0; i < nums.size()-1; i++) {
int local = nums[i];
robs1[i] = nums[i];
for(int j = i - 2; j >= 0; j--) {
local = robs1[i] + robs1[j] > local ? robs1[i] + robs1[j] : local;
}
robs1[i] = local;
if(local > global)
global = local;
}
for(int i = 1; i < nums.size(); i++) {
int local = nums[i];
robs2[i] = nums[i];
for(int j = i - 2; j > 0; j--) {
local = robs2[i] + robs2[j] > local ? robs2[i] + robs2[j] : local;
}
robs2[i] = local;
if(local > global)
global = local;
}
return global;
}
};
Java版:
public class Solution {
public int rob(int[] nums) {
if(nums.length == 1)
return nums[0];
int[] rob1 = new int[nums.length];
int[] rob2 = new int[nums.length];
int global = 0;
for(int i = 0; i < nums.length - 1; i++) {
int local = nums[i];
rob1[i] = nums[i];
for(int j = i - 2; j >= 0; j--) {
local = rob1[i] + rob1[j] > local ? rob1[i] + rob1[j] : local;
}
rob1[i] = local;
if(local > global)
global = local;
}
for(int i = 1; i < nums.length; i++) {
int local = nums[i];
rob2[i] = nums[i];
for(int j = i - 2; j > 0; j--) {
local = rob2[i] + rob2[j] > local ? rob2[i] + rob2[j] : local;
}
rob2[i] = local;
if(local > global)
global = local;
}
return global;
}
}
Python版:
class Solution:
# @param {integer[]} nums
# @return {integer}
def rob(self, nums):
if len(nums) == 1:
return nums[0]
robber = [0] * len(nums)
robber2 = [0] * len(nums)
rob = 0
for i in range(len(nums)):
if i < len(nums) - 1:
robber[i] = nums[i]
local = nums[i]
for j in range(0, i - 1):
local = local if robber[i] + robber[j] <= local else robber[i] + robber[j]
robber[i] = local
if local > rob:
rob = local
if i > 0:
robber2[i] = nums[i]
local2 = nums[i]
for j in range(1, i - 1):
local2 = local2 if robber2[i] + robber2[j] <= local2 else robber2[i] + robber2[j]
robber2[i] = local2
if local2 > rob:
rob = local2
return rob