*LeetCode 213. House Robber II

https://leetcode.com/problems/house-robber-ii/

House Robber I那道线的题不说了，直接O(n)搞定。

环的开始写成O(n^2)了，就是枚举每一个起始位置，用House Robber I的做法。

const int SIZE = 1000+1;
int dp[SIZE][SIZE];

class Solution {
public:
    int legal(int a, int b, int n) {
        return !(a == b || a == (b + 1)%n || (a + 1)%n == b);
    }
    int rob(vector<int>& nums) {
        if (nums.size() == 0)return 0;
        if (nums.size() == 1)return nums[0];
        if (nums.size() == 2)return max(nums[0], nums[1]);
        if (nums.size() == 3) return max(nums[0], max(nums[1], nums[2]));
        
        int max_v = 0, n = nums.size();
        for (int i = 0; i < n; i++) {
            for (int j = i; j < i + n; j++) {
                int idx = j%n;
                dp[i][idx] =  nums[idx];
                if(j != i+n-1 && j >= i + 3 && idx >= (i+3)%n && legal((idx-3+n)%n, idx, n))dp[i][idx] = max(dp[i][idx], dp[i][(idx-3+n)%n] + nums[idx]);
                if(j != i+n-1 && j >= i + 2 && idx >= (i+2)%n && legal((idx-2+n)%n, idx, n))dp[i][idx] = max(dp[i][idx], dp[i][(idx-2+n)%n] + nums[idx]);
                //if(idx >= (i+1)%n)dp[i][idx] = max(dp[i][idx], dp[i][(idx-1+n)%n] );
                max_v = max(max_v, dp[i][idx]);
                //cout << "i:" << i << " idx:" << idx << " v:" << dp[i][idx] << endl;
            }
        }
        
        return max_v;
    }
};

实际应该变成环后考虑对解的影响，也就一种情况不能取，就是最后一个元素和第一个元素同时取，因此有如下代码：

const int SIZE = 1000+1;
int dp[SIZE];

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