House Robber II

最新推荐文章于 2022-11-01 19:16:12 发布

原创最新推荐文章于 2022-11-01 19:16:12 发布 · 714 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#House #Robber #leetcode #II

算法专栏收录该内容

83 篇文章

订阅专栏

本文探讨了圆环型房屋盗窃问题，即所有房屋形成一个闭环，不能连续抢劫首尾两家。通过House Robber算法的变形解决此问题，包括遍历两次数组来找出最大收益。

摘要生成于 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.

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

思路：House Robber的变形，因为牵扯到圆环问题，所以首尾不能相连，
需要遍历两次：0-nums.length-2和1-nums.length-1，然后返回一个最大值。

public class Solution {
    public int rob(int[] nums) {
        if(nums.length==0){
            return 0;
        }
        if(nums.length==1){
            return nums[0];
        }
        if(nums.length==2){
            return Math.max(nums[0],nums[1]);
        }
        int m1=rob(nums,0,nums.length-2);
        int m2=rob(nums,1,nums.length-1);
        return Math.max(m1,m2);
    }
    private int rob(int[]nums, int s, int e){
        int[] sum = new int[e-s+1];
        sum[0]=nums[s];
        sum[1]=Math.max(nums[s],nums[s+1]);//important
        for(int i=s+2;i<=e;i++){
            sum[i-s]=Math.max(sum[i-1-s],sum[i-2-s]+nums[i]);//nums[i]important
        }
        return sum[e-s];
    }
}