# Leetcode 213. House Robber II (Medium) (cpp)

Leetcode 213. House Robber II (Medium) (cpp)

Tag: Dynamic Programming

Difficulty: Medium

/*

213. House Robber II (Medium)

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.

*/
class Solution {
public:
int rob(vector<int>& nums) {
int _size = nums.size();
if (_size < 2) return _size ? nums[0] : 0;
return max(robber(nums, 0, _size - 2), robber(nums, 1, _size - 1));
}
int robber(vector<int>& nums, int l, int r) {
int pre = 0, cur = 0;
for (int i = l; i <= r; i++) {
int temp = max(pre + nums[i], cur);
pre = cur;
cur = temp;
}
return cur;
}
};

06-13 1567

05-21 1万

08-19 738

12-11 43

11-05 774

06-01 2035

04-01 7867

04-01 4583

03-27 980

03-12 2700