refactor 565

fishercoder1534 · fishercoder1534 · commit 53c1e8de98ac · 2019-07-07T07:11:15.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_565.java b/src/main/java/com/fishercoder/solutions/_565.java
@@ -28,23 +28,25 @@
  */
 public class _565 {
 
-    public int arrayNesting(int[] nums) {
-        if (nums == null || nums.length == 0) {
-            return 0;
-        }
-        boolean[] visited = new boolean[nums.length];
-        int answer = 0;
-        for (int i : nums) {
-            int count = 0;
-            int j = i;
-            while (j >= 0 && j < nums.length && !visited[j]) {
-                count++;
-                visited[j] = true;
-                j = nums[j];
+    public static class Solution1 {
+        public int arrayNesting(int[] nums) {
+            if (nums == null || nums.length == 0) {
+                return 0;
+            }
+            boolean[] visited = new boolean[nums.length];
+            int answer = 0;
+            for (int i : nums) {
+                int count = 0;
+                int j = i;
+                while (j >= 0 && j < nums.length && !visited[j]) {
+                    count++;
+                    visited[j] = true;
+                    j = nums[j];
+                }
+                answer = Math.max(answer, count);
             }
-            answer = Math.max(answer, count);
+            return answer;
         }
-        return answer;
     }
 
 }
