LeetCode-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.

我在想循环vector怎么实现？其实你别管它怎么实现，不影响策略，只需要知道nums[0] 和nums[n-1]不同时出现就对了。那么就是说，用分开两次执行rob策略就能达到这一目的，至于为什么头尾分开就能实现呢？画过几组他们的情景，列举出来就能发现，这是可行的。手稿图如下（手稿图远没有列举情景，但是都可以发散类推，至于公式或者总结并无必要，只需要看图就能理解其中大意。。。）

下面是code：

class Solution {
public:
    int rob(vector<int>& nums) {
    	int n = nums.size();
    	if(n == 0) return 0;
    	else if(n == 1) return nums[0];
    	else{
    		return max(rob(nums,0,n - 1),rob(nums,1,n));
    	}
        
    }
    int rob(std::vector<int> & nums,int start,int end){
    	int pre1 = 0;
    	int pre2 = 0;
    	int maxV;
    	for(int i = start; i < end; i ++){
    		maxV = max(pre1,pre2 + nums[i]);
    		pre2 = pre1;
    		pre1 = maxV;
    	}
    	return pre1;
    }
};