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.

解题思路：和题目House Robber比较类似，因为最后一个房屋和第一个房屋相邻，因此可以根据是否盗窃第一个房屋来把这个问题分解成两个子问题：（1）盗窃第一个房屋能获得的最大金钱数目，这时最后一个房屋就不能再盗窃（2）不盗窃第一个房屋能获得的最大金钱数目，这时可以盗窃最后一个房屋。两个子问题可以用和House Robber题目相同的动态规划方法解决，最后求两个子问题的最大值即为所求的结果

AC代码如下：

class Solution {
public:
	int rob(vector<int>& nums) {
		int n = nums.size();
		if (n == 0) return 0;
		if (n == 1)return nums[0];
		vector<int> d1(n, 0);
		vector<int> d2(n, 0);
		d1[0] = nums[0];
		d1[1] = nums[0];
		for (int i = 2; i < n-1; ++i){
			d1[i] = max(nums[i] + d1[i - 2], d1[i - 1]);
		}
		d2[0] = 0;
		d2[1] = nums[1];
		for (int i = 2; i < n; ++i){
			d2[i] = max(nums[i] + d2[i - 2], d2[i - 1]);
		}
		return max(d1[n - 2], d2[n - 1]);
	}
};