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.
這回第一家和最后一家連在了一起踪古，那就意味著如果搶了第一家就不能搶最后一家含长，搶了最后一家就不能搶第一家券腔，那我們就看看這兩種情況哪個大咯。
可以利用上一題的解法：
var rob = function(nums) {
var help = function(nums) {
if(nums.length === 0)
return 0;
if(nums.length === 1)
return nums[0];
nums[1] = Math.max(nums[0], nums[1]);
for(var i = 2; i < nums.length; i++){
nums[i] = Math.max(nums[i-2] + nums[i], nums[i - 1]);
}
return nums[nums.length - 1];
};
var num = nums.length;
if (num===1)
return nums[0];
return Math.max(help(nums.slice(0,num-1)),help(nums.slice(1,num)));
};
