LeetCode:House Robber II

最新推荐文章于 2019-09-12 15:27:42 发布

原创最新推荐文章于 2019-09-12 15:27:42 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #House Robber II

LeetCode OJ 同时被 2 个专栏收录

216 篇文章

订阅专栏

LeetCode解题记录

216 篇文章

订阅专栏

本文探讨了HouseRobberII问题，这是一种动态规划问题的扩展，涉及到在一个环形排列的房屋中进行抢劫，同时避免触发警报。文章提供了一种有效的解决方案，并通过具体的代码实现来解释如何计算最大可能抢到的钱数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

House Robber II

Total Accepted: 23515 Total Submissions: 78696 Difficulty: 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.

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags

Dynamic Programming

Hide Similar Problems

(E) House Robber (M) Paint House (E) Paint Fence

LeetCode:House Robber的变形

code:

class Solution {
public:
    int rob(vector<int>& nums) {
        int n = nums.size();
        if(n==0) return 0;
        if(n==1) return nums[0];
        return max(_rob(nums,0,n-2),_rob(nums,1,n-1));
    }
    
    int _rob(vector<int>& nums, int lo, int hi) {
        
        int preN = 0;
        int preY = 0;
        
        for(int i=lo;i<=hi;i++){
            int tmp = preY;
            preY = max(preN,preY);
            preN = tmp + nums[i];
        }
        return max(preN,preY);
    }
};