【leetcode】【medium】213. House Robber II​​​​​​​

213. House Robber 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 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.

题目链接：https://leetcode-cn.com/problems/house-robber-ii/

 

思路

DP练习。

相比上一题，本题的街道变成环形，出现了两种情况：

1）头不透；

2）尾不偷。

所以两种情况分两次循环。

class Solution {
public:
    int rob(vector<int>& nums) {
        int len = nums.size();
        if(len==0) return 0;
        if(len==1) return nums[0];
        int res[len]={0, nums[1]};
        for(int i=2; i<len; ++i){
            res[i] = max(nums[i]+res[i-2], res[i-1]);
        }
        int rlt = res[len-1];
        memset(res, 0, (len-1)*sizeof(int));
        res[len-1] = 0;
        res[len-2] = nums[len-2];
        for(int i=len-3; i>=0; --i){
            res[i] = max(nums[i]+res[i+2], res[i+1]);
        }
        return max(rlt, res[0]);
    }
};

优化：减小空间

只记录前两个结果，减少空间使用，也能提高运行速度。

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