LeetCode – 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.

Example 1:

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.

Example 2:

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

题意：

假设你是一位职业抢劫者，需要规划一条街的抢劫方法。每个房间都藏有一定数量的钱，抢劫的唯一约束是，相邻房间之间有安全系统连接，如果同晚相邻的房间被抢，安全系统将会自动报警。
给定一列非负整数表示每间房的钱数，计算在不触发安全系统的条件下，你能够抢到的最多钱数。

分析：

本题实质上LeetCode – 740. Delete and Earn的变种。小偷不能到两栋相邻的房子里进行偷窃。如果我们把房子里的财物的价值用数组表示，也就是如果他偷得了数组中第i个数字的财物，就不能偷得数组中第i-1和i+1个数字的财物。我们把LeetCode第740题中的nums转换成vals之后，两个题目就一样了。

解题思路相差不多，需要注意的是两道题的边界判断。

public static int rob(int[] nums) {
	if (nums.length == 0) {
		return 0;
	} else if (nums.length == 1) {
		return nums[0];
	}
	int f1 = nums[0];
	int f2 = Math.max(nums[0], nums[1]);
	int max = f2;
	for (int i = 2; i < nums.length; i ++) {
		max = Math.max(f2, f1 + nums[i]);
		f1 = f2;
		f2 = max;
	}
	return max;
}