|
1 | 1 | packagecom.fishercoder.solutions; |
2 | | -/** |
3 | | - * 213. House Robber II |
4 | 2 |
|
5 | | - Note: This is an extension of House Robber. |
6 | | -
|
7 | | - After robbing those houses on that street, |
8 | | - the thief has found himself a new place for his thievery |
9 | | - so that he will not get too much attention. |
10 | | - This time, all houses at this place are arranged in a circle. |
11 | | - That means the first house is the neighbor of the last one. |
12 | | - Meanwhile, the security system for these houses remain the same as for those in the previous street. |
13 | | -
|
14 | | -Given a list of non-negative integers representing the amount of money of each house, |
15 | | - determine the maximum amount of money you can rob tonight without alerting the police. |
16 | | -*/ |
17 | 3 | publicclass_213 { |
18 | 4 | publicstaticclassSolution1 { |
19 | 5 | /** |
|