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)偷第0到第n-2家
2)偷第1到第n-1家
然后返回两种情况的较大值即可。
C++代码:
class Solution {
public:
int rob(vector<int>& nums) {
int length = nums.size();
if(length == 0) return 0;
if(length == 1) return nums[0];
return max(robber(nums, 0, length-2), robber(nums, 1, length-1));
}
int robber(vector<int>& nums, int left, int right) {
int pre = 0;
int cur = 0;
for(int i = left; i <= right; i++) {
int temp = max(pre+nums[i], cur);
pre = cur;
cur = temp;
}
return cur;
}
};