LeetCode 213: House Robber II

https://daiyuhe.com/leetcode-213-house-robber-ii/

House Robber II

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

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.

Example 1:

Input: [2,3,2]
Output: 3
Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2),
             because they are adjacent houses.

Example 2:

Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
             Total amount you can rob = 1 + 3 = 4.

这一题是LeetCode 198的升级版，但题198不是环形的，这里就先给出题198的解题思路。

我们使用动态规划法，数组dp保存每个位置的最优解。
那么，当下标为i时，dp[i]的值就应该是dp[i-1]和(dp[i-2]+nums[i])中的最大值。

// Java实现
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[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++){
            dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        
        return dp[nums.length - 1];
    }
}

回到我们的第213题，由于是房屋为环形的，所以第一间跟最后一间房不能同时抢，这样我们可以分为两种情况，抢第一间或者不抢第一间，这样我们就把问题拆成了计算两次非环形的抢劫问题。

1. 抢第一间。最后一间不能抢，此时相当于取值范围[0, n-2]的题198。
2. 不抢第一间。第一间不能抢，此时相当于取值范围[1, n-1]的题198。

我们只需要分别计算这两种情况，并且取最大值即可。

// Java实现
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]);
        if (nums.length == 3)   return Math.max(nums[0], Math.max(nums[1], nums[2]));

        //rob the house 0
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for(int i = 2; i< nums.length - 1; i++){
            dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        int max = dp[nums.length - 2];
        
        //not rob the house 0
        dp[1] = nums[1];
        dp[2] = Math.max(nums[1], nums[2]);
        for(int i = 3; i< nums.length; i++){
            dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        
        return Math.max(max, dp[nums.length - 1]);
    }
}