Leetcode 213. House Robber II

213. House Robber II
     Medium

829

26

Favorite

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

题意：就是街上所有的房子围成一个圈，然后强盗去抢劫，不能抢相邻的，不然就出触发报警装置。

解析：其实和那个抢劫是一样的，只不过有个不同的是我们围成了一个圈。 其实我们可以进行拆分，因为第一个和末尾的最后一个不能同时抢，所以就分解成了(0,n-2)和（1，n-1）的抢劫问题。然后最后取最大即可。

代码：

class Solution
{
public:
    int solve(vector<int> &nums)
    {
    	int len = nums.size();
    	if(len == 2) return max(nums[0], nums[1]);
    	int ans = -1;
    	vector<int> dp(len, 0);
    	dp[0] = nums[0];
    	dp[1] = nums[1];
    	ans = max(dp[0], dp[1]);
    	for(int i = 2; i < len; i++)
    	{
    		int temp = dp[i-2] + nums[i];
    		dp[i] = max(temp, dp[i-1]);
    		ans = max(dp[i], ans);
    	}
    	return ans;
    }

    int rob(vector<int>& nums) 
    {
        int len = nums.size();
        if(len == 0) return 0;
        else if(len == 1) return nums[0];
        else if(len == 2) return max(nums[0], nums[1]);
        vector<int> sub_num1(nums.begin(), nums.begin() + len -1);
        vector<int> sub_num2(nums.begin()+1, nums.end());
        return max(solve(sub_num1), solve(sub_num2));
    }
};