Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit c2677c9

Browse files
refactor 213
1 parent 60e9528 commit c2677c9

File tree

1 file changed

+0
-14
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-14
lines changed

src/main/java/com/fishercoder/solutions/_213.java

Lines changed: 0 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,5 @@
11
package com.fishercoder.solutions;
2-
/**
3-
* 213. House Robber II
42

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-
*/
173
public class _213 {
184
public static class Solution1 {
195
/**

0 commit comments

Comments
 (0)