198. House Robber && 213. House Robber II && 337. House Robber III

198. House Robber

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.

Dynamic Programming

public class Solution {
    /*  O(n) time, O(1) space
        have i to iterate through nums
        use max to keep the maxSum in range [0, i-1];
        use max2Back to keep the maxSum with 2 steps back, which is in range [0, i-2];
        new max will be calulated as max2Back+nums[i]
    */
    public int rob(int[] nums) {
        if(nums.length == 0)
            return 0;
        if(nums.length == 1)
            return nums[0];
        int max = Math.max(nums[0],nums[1]);
        if(nums.length == 2)
            return max;
        
        int max2Back = nums[0];
        for(int i = 2; i<nums.length; ++i){
            int currentMax = max2Back+nums[i];
            max2Back = max;
            max=Math.max(currentMax,max);
        }
        return max;
    }
}

 

213. House Robber II

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.

 

public class Solution {
    public int rob(int[] nums) {
        if(nums.length == 0)
            return 0;
        //Two cases to consider:
        //1. Rob the first house
        //2. Don't rob the first house
        return Math.max(nums[0] + rob1(nums, 2, nums.length -2), 
            rob1(nums, 1, nums.length-1));
    }
    
    //rob within range [from, to]
    private int rob1(int[] nums, int from, int to) {
        int len = to-from+1;
        if(len <= 0)
            return 0;
        if(len == 1)
            return nums[from];
        int max = Math.max(nums[from],nums[from+1]);
        if(len == 2)
            return max;
        
        int max2Back = nums[from];
        for(int i = from+2; i<=to; ++i){
            int currentMax = max2Back+nums[i];
            max2Back = max;
            max=Math.max(currentMax,max);
        }
        return max;
    }
}

 

337. House Robber III

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.

 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int rob(TreeNode root) {
        if(root == null)
            return 0;
        if(root.left == null && root.right == null)
            return root.val;
        
        int sum1 = root.val;
        if(root.left != null)
            sum1 += rob(root.left.left) + rob(root.left.right);
        if(root.right != null)
            sum1 += rob(root.right.left) + rob(root.right.right);
        return Math.max(sum1, rob(root.left)+rob(root.right));
        
    }
}

 

 

 

 

 

 

 

 

 

转载于:https://www.cnblogs.com/neweracoding/p/5421106.html