[LeetCode]198. House Robber&213. House Robber II&337. House Robber III

198 . House Robber
Easy

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that 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.

0ms:

  public int rob(int[] nums) {
        if(nums.length==0) return 0;
        if(nums.length==1) return nums[0];

        nums[1] = Math.max(nums[0], nums[1]);

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

        return nums[nums.length-1];
    }

213 . House Robber II
Medium

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.

0ms:

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]);
        return Math.max(rob2_(nums,0,nums.length-2), rob2_(nums,1,nums.length-1));

}
private int rob2_(int[]nums, int start,int end){
        int len = end-start+1;
        int[] tmp = new int[len];
        tmp[0] = nums[start];
        tmp[1] = Math.max(nums[start], nums[start+1]);
        for(int i=2;i<len;i++){
            tmp[i] = Math.max(tmp[i-2]+nums[start+i], tmp[i-1]);
        }
        return tmp[len-1];
}

337 . House Robber III
Medium

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that “all houses in this place forms a binary tree”. It will automatically contact the police if two directly-linked houses were broken into on the same night.

Determine the maximum amount of money the thief can rob tonight without alerting the police.

Example 1:
3
/ \
2 3
\ \
3 1
Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.
Example 2:
3
/ \
4 5
/ \ \
1 3 1
Maximum amount of money the thief can rob = 4 + 5 = 9.

1ms:

 public int rob(TreeNode root) {  
        return dfs(root)[1];  
}  
private int[] dfs(TreeNode root) {  
        int[] rob ={0, 0};  
        if(root != null) {  
            int[] robLeft = dfs(root.left);  
            int[] robRight = dfs(root.right);  
            rob[0] = robLeft[1] + robRight[1];  
            rob[1] = Math.max(robLeft[0] + robRight[0] + root.val, rob[0]);  
        }  
        return rob;  
}  

2ms:

public int rob(TreeNode root) {
        int[] res = robSub(root);
        return Math.max(res[0], res[1]);
}

public int[] robSub(TreeNode root){
        if(root == null)
            return new int[2];

        int[] left = robSub(root.left);
        int[] right = robSub(root.right);

        int[] res = new int[2];
        res[0] = Math.max(left[0], left[1]) + Math.max(right[0], right[1]); // do not choose current node
        res[1] = root.val + left[0] + right[0]; // choose current node

        return res;
}