一:题目
二:上码
class Solution {
public:
int rob(vector<int>& nums) {
if(nums.size() == 0) return 0;
if(nums.size() == 1) return nums[0];
int ans1 = steal(nums,0,nums.size()-2);
int ans2 = steal(nums,1,nums.size()-1);
return ans1 > ans2 ? ans1 : ans2;
}
int steal(vector<int> & nums,int start,int end) {
if (end == start) return nums[start];
vector<int> dp(nums.size(),0);
dp[start] = nums[start];
dp[start+1] = max(nums[start],nums[start+1]);
for(int i = start+2; i <= end; i++) {
dp[i] = max(dp[i-1],dp[i-2]+nums[i]);
}
return dp[end];
}
};