213. House Robber II（python+cpp）

题目：

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.

解释：
和I的要求类似，唯一不同的是房子构成了一个圈，也就是第一家和最后一家是有联系的。抢了第一家就不能抢最后一家，抢了最后一家就不能抢第一家，或者两家都不抢。
变通：将第一家和最后一家分别去掉，分别计算House Robber I，求这两个中的最大值，但是，我觉得这种方法不合理 ，比如，如果在House Robber(nums[:-1])的时候，刚好没有偷第一家，而且刚好也没有偷倒数第二家，那么此时加上 最后一家的结果一定比不加上的大呀（不偷最后一家的时候情况类似）
一种合理的方式是这样分类，按照偷盗第一家和不偷盗第一家来进行分类：
1.rob0 nums[0]+House Robber(nums[2:-1])
2.not rob0 House Robber(nums[1:])
python代码：

class Solution(object):
    def rob(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:
            return 0
        #同House Robber I
        def lineRob(nums):
            if not nums:
                return 0
            n=len(nums)
            if n<2:
                return nums[0]
            dp=[0]*n
            dp[0]=nums[0]
            dp[1]=max(nums[0],nums[1])
            for i in xrange(2,n):
                dp[i]=max(dp[i-1],dp[i-2]+nums[i])
            return dp[n-1]
        #rob0,那么一定不要最后一个
        return max((nums[0]+lineRob(nums[2:-1])),lineRob(nums[1:]))

c++代码：

class Solution {
public:
    int rob(vector<int>& nums) {
        int n=nums.size();
        if (n<2)
            return n?nums[0]:0;
        if (n==2)
            return max(nums[0],nums[1]);
        vector<int>nums1(nums.begin()+2,nums.end()-1);
        vector<int>nums2(nums.begin()+1,nums.end());
        return max(nums[0]+lineRob(nums1),lineRob(nums2));
    }
    int lineRob(vector<int>&nums)
    {
        int n=nums.size();
        cout<<n<<endl;
        if (n<2)
            return n?nums[0]:0;
        vector<int>dp(n,0);
        dp[0]=nums[0];
        dp[1]=max(nums[0],nums[1]);
        for(int i=2;i<n;i++)
            dp[i]=max(dp[i-1],dp[i-2]+nums[i]);
        return dp[n-1];
    }
};

总结：
c++代码中一定要加上if (n==2)的判断，不然会内存报错，python代码中就没有这个问题。