House Robber II
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 arearranged 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 tonightwithout alerting the police.
Example 1:
Example 2:
分析
拆环:1.去头一个数组,去尾一个数组 2.double数组,然后一个window,长度是数组长度
注意这里yes 和No交换进行的方法
Last updated