LeetCode 213: House Robber II

LeetCode 213: House Robber II

思路

代码

public class Solution {
public int rob(int[] nums) {
int length = nums.length;
if (length == 0) return 0;
if (length == 1) return nums[0];
if (length == 2) return nums[0] > nums[1] ? nums[0] : nums[1];

//first case nums[0] is robbed
int first = nums[0], second = nums[0];
for (int i = 2; i < nums.length - 1; i++) {
int tmp = (first + nums[i]) > second ? (first + nums[i]) : second;
first = second;
second = tmp;
}
int ret = second;
//first case nums[0] is not robbed
first = 0;
second = nums[1];
for (int i = 2; i < nums.length; i++) {
int tmp = (first + nums[i]) > second ? (first + nums[i]) : second;
first = second;
second = tmp;
}
return ret > second ? ret : second;
}
}