leetcode--House Robber II

最新推荐文章于 2022-12-09 22:55:56 发布

crazy__chen

最新推荐文章于 2022-12-09 22:55:56 发布

阅读量620

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/crazy__chen/article/details/46580553

leetcode 专栏收录该内容

177 篇文章

订阅专栏

解决一个经典的动态规划问题——环形排列的房屋抢劫者问题。该问题是在一排环形排列的房屋中，作为窃贼如何选择抢劫目标才能获得最大金额，且不触发相邻房屋的警报。

摘要生成于 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 int rob(int[] nums) {
		if(nums==null || nums.length==0) return 0;  
        if(nums.length==1) return nums[0];  
        if(nums.length==2) return Math.max(nums[0], nums[1]);  
        return Math.max(helper(nums, 0, nums.length-2), helper(nums, 1, nums.length-1));  
    }
	
	public int helper(int[] nums,int start,int end){
		int n = end-start+1;
		if(n==0) return 0;
		if(n==1) return nums[start];
		int[] flag = new int[n];
		flag[0] = nums[start];
		flag[1] = Math.max(nums[start], nums[start+1]);		
		for(int i=start+2;i<=end;i++){
			flag[i-start] = Math.max(flag[i-start-2]+nums[i],flag[i-start-1]);			
		}
		return flag[n-1];
	}