213. House Robber II

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.搶房子0:

    results_1[0] = nums[0]
    results_1[0] = max(nums[0], nums[1])
    results_1[i] = max(results_1[i - 1], results_1[i - 2] + nums[i])    if  i >= 2
                       往前第一個        往前第二個  +  目前

2.不搶房子0:

    results_2[0] = 0
   results_2[0] = nums[1]
   results_2[i] = max(results_2[i - 1],results_2[i - 2] + results_2[i])    if  i >= 2
                       往前第一個        往前第二個  +  目前

做完遞歸之後，再將兩個結果進行比較

result = Math.max(results_1[n - 2], results_2[n - 1])    n為房子數量

package LeetCode.Medium;

public class HouseRobberII {
    public int rob(int[] nums) {
       if(nums == null || nums.length == 0) {
            return 0;
        }
        
        int n = nums.length;
        
        if(n == 1)
            return nums[0];
        
        //分兩種情況討論，搶房子0與不搶房子0
        
        //** House(0) is robbed **
        int[] results_1 = new int[n + 1];
        //定義初始狀態
        results_1[0] = nums[0];
        results_1[1] = Math.max(nums[0], nums[1]);
        for(int i = 2; i < n; i ++) {
            int rob_house_1 = results_1[i - 2] + nums[i]; //搶前面第二個+目前這個
            int rob_house_2 = results_1[i - 1]; //搶前面一個

            results_1[i] = Math.max(rob_house_1, rob_house_2); //比較兩者誰較大
        }
        //但最終結果為results_1[n - 2] (因為搶了最後一間房子並不能搶第一間房子)
        
        //** House(0) is not robbed **
        int[] results_2 = new int[n + 1];
        //定義初始狀態
        results_2[0] = 0; //房子0並不搶
        results_2[1] = nums[1];
        for(int i = 2; i < n; i ++) {
            int rob_house_1 = results_2[i - 2] + nums[i]; //搶前面第二個+目前這個
            int rob_house_2 = results_2[i - 1]; //搶前面一個
            
            results_2[i] = Math.max(rob_house_1, rob_house_2); //比較兩者誰較大
        }
        
        //比較兩個結果誰比較大
        int result = Math.max(results_1[n - 2], results_2[n - 1]);
        
        return result;
    }
}