Leetcode 213. House Robber II -打家劫舍，每家都有一定数量的钱，多家组成一个圆形，首尾相邻，不能偷盗相邻的两家，求可偷盗的最大金额

二十六画生的博客

于 2018-12-27 22:20:56 发布

阅读量434

点赞数

CC 4.0 BY-SA版权

分类专栏：笔试面经 LeetCode 剑指Offer 后端/大数据文章标签： Leetcode 218 House Robber II

本文链接：https://blog.csdn.net/u010002184/article/details/85311233

笔试面经 LeetCode 剑指Offer 后端/大数据专栏收录该内容

226 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

在LeetCode的213题中，你是一个专业盗贼，要抢劫一排成环形排列的房子，相邻房屋有警报系统，不能同时攻击相邻的两所房子。你需要找出不触发警报的情况下能抢到的最大金额。问题可以通过计算排除首尾两所房子的最大值来解决，即分别计算去掉第一所和最后一所房子的情况，最后取较大者作为答案。特殊情况包括空数组、只有一所房子和只有两所房子的情况。

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

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 hou

了解本专栏

超级会员免费看