213. House Robber II**

最新推荐文章于 2025-04-14 23:34:52 发布

Yingying_code

最新推荐文章于 2025-04-14 23:34:52 发布

阅读量253

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode Java Dynamic Programming

本文链接：https://blog.youkuaiyun.com/alwaystry/article/details/54808811

leetcode 同时被 3 个专栏收录

261 篇文章

订阅专栏

Java

188 篇文章

订阅专栏

Dynamic Programming

22 篇文章

订阅专栏

针对环形排列的房屋，提供了一种高效的算法解决方案来计算在不触动警报的情况下能抢夺的最大金额。此问题是在原线性房屋基础上的扩展。

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

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.

public class Solution {
    public int rob(int[] nums) {
        if(nums.length==1) return nums[0];
        return Math.max(rob(nums,0,nums.length-2),rob(nums,1,nums.length-1));
        
    }
    public int rob(int[] nums, int low, int high) {
    	int n = nums.length;
    	int pre = 0, cur =0;
    	for(int i =low;i<high;i++){
    		int temp = Math.max(pre+nums[i],cur);
    		pre =cur;
    		cur=temp;
    	}
    	return cur;
    }
}

总结：改成circle后那就考虑连接元素有没有被rob吧。