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

279人阅读 评论(0)

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;
}
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：54258次
• 积分：3633
• 等级：
• 排名：第8969名
• 原创：325篇
• 转载：0篇
• 译文：0篇
• 评论：0条
文章分类