Leetcode 213. House Robber II

213. House Robber II

题目

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.

解题思路

• 因为第一个房子和最后一个房子相邻，因此房子1和房子n至少有一个没有抢劫。

  若不抢劫房子1，则求在房子2~n中选择房子抢劫能获得的金钱的最大值；

  若不抢劫房子n，则求在房子1~n-1中选择房子抢劫能获得的金钱的最大值。

  在上述两种情况中选择值大的一个即为本题的解。

• 求在房子s~e中选择房子抢劫能获得的金钱的最大值时，可以采用动态规划的方法：

  用dp[i]表示在房子s~s+i中选择房子抢劫能获得的金钱的最大值；

  初始时dp[0] = nums[s]; dp[1] = max(nums[s], nums[s+1]);；

  状态转移方程：dp[i] = max(nums[s+i] + dp[i-2], dp[i-1]);；

  最终求得的dp[e-s]就是在房子s~e中选择房子抢劫能获得的金钱的最大值。

代码如下：

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

	int robSub(vector<int>& nums, int s, int e) {
		vector<int> dp(e-s+1);
		dp[0] = nums[s];
		dp[1] = max(nums[s], nums[s+1]);
		for (int i = 2; i <= e - s; i++) {
			dp[i] = max(nums[s+i] + dp[i-2], dp[i-1]);
		}
		return dp[e-s];
	}

};