House Robber 解答

Question

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.

Solution 1 -- DP

The key is to find the relation dp[i] = Math.max(dp[i-1], dp[i-2]+num[i-1]). Time complexity O(n), space cost O(n).

public class Solution {
    public int rob(int[] nums) {
        if (nums == null || nums.length < 1)
            return 0;
        int length = nums.length;
        int[] dp = new int[length + 1];
        dp[0] = 0;
        dp[1] = nums[0];
        for (int i = 2; i <= length; i++) {
            dp[i] = Math.max(dp[i - 1], nums[i - 1] + dp[i - 2]);
        }
        return dp[length];
    }
}

Solution 2

Another method is to use two counters, one for even number and the other for odd number.

public class Solution {
    public int rob(int[] nums) {
        if (nums == null || nums.length < 1)
            return 0;
        int odd = 0, even = 0, length = nums.length;
        for (int i = 0; i < length; i++) {
            if (i % 2 == 0) {
                even += nums[i];
                even = even > odd ? even : odd;
            } else {
                odd += nums[i];
                odd = odd > even ? odd : even;
            }
        }
        return even > odd ? even : odd;
    }
}