LeetCode 213 - House Robber II

最新推荐文章于 2025-04-14 23:34:52 发布

yuanhisn

最新推荐文章于 2025-04-14 23:34:52 发布

阅读量84

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode dynamic programming

本文链接：https://blog.youkuaiyun.com/yuanhisn/article/details/84720649

leetcode 同时被 2 个专栏收录

94 篇文章

订阅专栏

dynamic programming

18 篇文章

订阅专栏

解决一个经典的动态规划问题——环形房屋抢劫者问题。在这个问题中，一系列的房子以环形排列，首尾相连，每间房子都有一定的金额，目标是在不触动警报的情况下最大化抢劫所得。文章提供了一个高效的解决方案，并通过代码实现。

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

Note: This is an extension of House Robber.

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.

Solution:

int rob(vector<int>& nums) {
    if(nums.empty()) return 0;
    int n = nums.size();
    if(n == 1) return nums[0];
    return max(rob_util(nums, 1, n-1), rob_util(nums, 0, n-2));
}

int rob_util(vector<int>& nums, int start, int end) {
    int now = 0, prev = 0;
    for(int i=start; i<=end; i++) {
        int tmp = now;
        now = max(now, nums[i]+prev);
        prev = tmp;
    }
    return now;
}