213. House Robber II(强盗抢劫2)（leetcode）

最新推荐文章于 2021-03-31 11:03:49 发布

weixin_33728708

最新推荐文章于 2021-03-31 11:03:49 发布

阅读量120

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/shaer/p/10518963.html

版权

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.
题目分析：在上个题的情况下，让首尾相连，组成环形。这个题的思路也是在上个题的基础上掐头去尾。