213. House Robber II

题目

Note: This is an extension of House Robber.

After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, the security system for these houses remain the same as for those in the previous street.

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.

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

分析

头和尾也不能同时选, 所以从(0, n-2)做一次,(1,n-1)做一次house robber

实现

class Solution {
public:
    int rob(vector<int>& nums) {
        int n = nums.size();
        if (n <= 0) return 0;
        if (n == 1) return nums[0];
        if (n == 2) return max(nums[0], nums[1]);
        return max(helper(nums,0,n-2),helper(nums, 1,n-1));
    }

    int helper(vector<int>& nums,int left, int right) {
        vector<int> dp(nums.size(), 0);
        dp[left] = nums[left];
        dp[left+1] = nums[left+1] > nums[left]?nums[left+1]:nums[left];
        for (int i = left+2; i <= right; i++) {
            dp[i] = max(dp[i-1], dp[i-2]+nums[i]);
        }
        return dp[right];
    }
};