LeetCode -- 213. House Robber II

题目：

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. 计算0,1,...,n-1的最大值，
2. 计算1,2,...,n的最大值，
3. 返回1和2的最大值。

详细解题思路请见：House Robber

---

C++代码：

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

        vector<int> dist(nums.size(), 0);
        dist[0] = nums[0];
        dist[1] = max(nums[0], nums[1]);
        for(int i=2; i<nums.size()-1; ++i){
            dist[i] = max(dist[i-1], dist[i-2]+nums[i]);
        }
        int a = dist[nums.size()-2];

        dist[1] = nums[1];
        dist[2] = max(nums[1], nums[2]);
        for(int i=3; i<nums.size(); ++i){
            dist[i] = max(dist[i-1], dist[i-2]+nums[i]);
        }
        int b = dist[nums.size()-1];
        return max(a, b);
    }
};