LeetCode动态规划 打家劫舍II

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 a security system connected, and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

这道题的主要思路是动态规划+分而治之。本道题的难点在于点的分布是一个圈，第一个和最后一个不能同时都偷。起初不知道怎么处理，后来看了别人的思路，想到可以把点的分布按照过不过第一个点，将其分成两种情况。然后分别进行dp求解，最后输出两种情况中值较大的那个。

状态转移方程
dp[i] = max(dp[i-2] + dp[i], dp[i-1])
边界条件
dp[0] = dp[0], dp[1] = max(dp[0], dp[1])

class Solution {
public:
    int rob(vector<int>& nums) {
        int dp1[105], dp2[105];
        int top = nums.size();
        if(top == 0)
        return 0;
        else if(top == 1)
        return nums[0];
        for(int i = 0; i < top-1; i++)
        dp1[i] = nums[i];
        dp1[1] = max(dp1[0], dp1[1]);
        for(int j = 1; j < top; j++)
        dp2[j-1] = nums[j];
        dp2[1] = max(dp2[0], dp2[1]);

        for(int i = 2; i < top-1; i++)
        dp1[i] = max(dp1[i-2] + dp1[i], dp1[i-1]);
        for(int i = 2; i < top-1; i++)
        dp2[i] = max(dp2[i-2] + dp2[i], dp2[i-1]);
        return max(dp1[top-2], dp2[top-2]);
    }
};