# 213. House Robber II

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 are arranged 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 tonight without alerting the police.

0到n-2之间的和1到n-1之间的，比较这两个大小，取大即可。

class Solution {
public:
int rob(vector<int>& nums) {
int len = nums.size();
if( len<2 ){
return len?nums[0]:0;
}

return max(robber(nums,0,len-2), robber(nums,1,len-1));
}
int robber(vector<int>& nums, int l, int r){
int pre = 0, cur = 0;
for(int i=l; i<=r; i++){
int tmp = max(pre+nums[i], cur);
pre = cur;
cur = tmp;
}
return cur;
}
};

• 本文已收录于以下专栏：

举报原因： 您举报文章：213. House Robber II 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)