问题描述
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, 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: [2,3,2]
Output: 3
Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2),
because they are adjacent houses.
Example 2:
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.
与 House Robber 区别:第一个和最后一个是相邻的
思路
类似https://blog.csdn.net/weixin_44135282/article/details/100862773,可以改为一个函数,实现指定起始与结束位置的数组的最大抢劫金额
java实现
public class Solution {
//1 2 3
public int rob(int[] nums) {
int len=nums.length;
if(nums==null || len==0)
return 0;
if(len==1) return nums[0];
if(len==2) return Math.max(nums[0], nums[1]);
return Math.max(robsub(nums, 0, len-2), robsub(nums, 1, len-1));//因为第一个与最后一个是相邻的,所以不能同时包括
}
//实现指定起始与结束位置的数组的最大抢劫金额
private int robsub(int[] nums, int start, int end) {
int n = end - start + 1;
int[] d =new int[n];
d[0] = nums[start];
d[1] = Math.max(nums[start], nums[start+1]);
for(int i=2; i<n; i++) {
d[i] = Math.max(d[i-2]+nums[start+i], d[i-1]);
}
return d[n-1];
}
}