House Robber II

最新推荐文章于 2022-11-01 19:16:12 发布

spongewxy

最新推荐文章于 2022-11-01 19:16:12 发布

阅读量388

点赞数

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/XDU_PYL/article/details/46537271

版权

LeetCode 专栏收录该内容

26 篇文章

订阅专栏

解决一个贼如何在环形排列的房屋中抢劫而不被发现的问题。通过动态规划算法找到最大收益。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

解题思路：简单DP

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