LeetCode 213. House Robber II 注意考察环尾和环头交叉处

最新推荐文章于 2022-02-27 13:50:35 发布

大疯疯

最新推荐文章于 2022-02-27 13:50:35 发布

阅读量338

点赞数

分类专栏： LeetCode LeetCide 动态规划文章标签： leetcode

本文链接：https://blog.csdn.net/wys2011101169/article/details/73521662

版权

LeetCode 同时被 2 个专栏收录

67 篇文章 1 订阅

订阅专栏

LeetCide 动态规划

7 篇文章 0 订阅

订阅专栏

213. House Robber II

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.

题意

该题和198. House Robber类似，条件从一排房屋变为圆形的房屋，不能连续偷取相邻的房屋，最终使偷取的价值最大

思路

需要考虑的是头和尾相邻处，当偷取头0号房屋，范围就是[0..n-1)
当不偷取0号房屋，范围就是[1…n)。
相当于做了两遍198. House Robber

代码

class Solution {
public:
    int rob(vector<int>& nums) {
        if(nums.size() == 0)
            return 0;
        if(nums.size() == 1)
            return nums[0];

        int best0 = 0;   // 表示没有选择当前houses  
        int best1 = 0;   // 表示选择了当前houses  
        for(int i = 0; i < nums.size()-1; i++){  
            int temp = best0;  
            best0 = max(best0, best1); // 没有选择当前houses，那么它等于上次选择了或没选择的最大值  
            best1 = temp + nums[i]; // 选择了当前houses，值只能等于上次没选择的+当前houses的money  
        }  
        int cur1 = max(best0, best1);  

        best0 = 0;   // 表示没有选择当前houses  
        best1 = 0;   // 表示选择了当前houses  
        for(int i = 1; i < nums.size(); i++){  
            int temp = best0;  
            best0 = max(best0, best1); // 没有选择当前houses，那么它等于上次选择了或没选择的最大值  
            best1 = temp + nums[i]; // 选择了当前houses，值只能等于上次没选择的+当前houses的money  
        }  
        int cur2= max(best0, best1);  

        return max(cur1,cur2);
    }
};