House Robber II

来源:互联网 发布:青岛seo公司排名 编辑:程序博客网 时间:2024/06/06 10:39

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.

https://leetcode.com/discuss/36544/simple-ac-solution-in-java-in-o-n-with-explanation




0 0
原创粉丝点击