leetcode 213. House Robber II

最新推荐文章于 2024-09-21 10:02:17 发布

frankstar123

最新推荐文章于 2024-09-21 10:02:17 发布

阅读量302

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/cfylove/article/details/51684850

版权

题目内容
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.

题目分析
和 house robber 1 相比，本题是将数组的首尾连接起来了。所以会出现的情况是，当选择了index=0的house又选择了 index=nums.length-1 的house 的时候，会产生错误的结果。
所以在这里为了避免这样的结果产生，我们以index=0 和以index=1 分别为计算的起始位置来求解即可。

代码

 public class Solution {
        public int rob(int[] nums) {
            if(nums.length == 0) return 0;
            if(nums.length == 1) return nums[0];
            int firstInc = nums[0];
            int firstExc = 0;
            int nonFirstInc = 0;
            int nonFirstExc = 0;

            for(int i = 1; i < nums.length; i++) {
                int preFirstInc = firstInc;
                firstInc = firstExc + nums[i];
                firstExc = Math.max(preFirstInc, firstExc);

                int preNFinc = nonFirstInc;
                nonFirstInc = nonFirstExc + nums[i];
                nonFirstExc = Math.max(preNFinc, nonFirstExc);
            }

            int maxInc = Math.min(firstInc, nonFirstInc);

            return Math.max(maxInc, firstExc);
        }
    }

代码2

public class Solution {
    public int rob(int[] nums) {
        if (nums.length == 0)
            return 0;
        if (nums.length < 2)
            return nums[0];

        int[] startFromFirstHouse = new int[nums.length + 1];
        int[] startFromSecondHouse = new int[nums.length + 1];

        startFromFirstHouse[0]  = 0;
        startFromFirstHouse[1]  = nums[0];
        startFromSecondHouse[0] = 0;
        startFromSecondHouse[1] = 0;

        for (int i = 2; i <= nums.length; i++) {
            startFromFirstHouse[i] = Math.max(startFromFirstHouse[i - 1], startFromFirstHouse[i - 2] + nums[i-1]);
            startFromSecondHouse[i] = Math.max(startFromSecondHouse[i - 1], startFromSecondHouse[i - 2] + nums[i-1]);
        }

        return Math.max(startFromFirstHouse[nums.length - 1], startFromSecondHouse[nums.length]);
    }
}