package com.fishercoder.solutions;

/**
 * 565. Array Nesting
 *
 A zero-indexed array A consisting of N different integers is given. The array contains all integers in the range [0, N - 1].

 Sets S[K] for 0 <= K < N are defined as follows:

 S[K] = { A[K], A[A[K]], A[A[A[K]]], ... }.

 Sets S[K] are finite for each K and should NOT contain duplicates.

 Write a function that given an array A consisting of N integers, return the size of the largest set S[K] for this array.

 Example 1:
 Input: A = [5,4,0,3,1,6,2]
 Output: 4
 Explanation:
 A[0] = 5, A[1] = 4, A[2] = 0, A[3] = 3, A[4] = 1, A[5] = 6, A[6] = 2.

 One of the longest S[K]:
 S[0] = {A[0], A[5], A[6], A[2]} = {5, 6, 2, 0}
 Note:
 N is an integer within the range [1, 20,000].
 The elements of A are all distinct.
 Each element of array A is an integer within the range [0, N-1].
 */
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];
            }
            answer = Math.max(answer, count);
        }
        return answer;
    }

}

@@ -866,16 +866,56 @@
 _565 %7B%0A%0A
+    public static class Solution1 %7B%0A    
     publ
@@ -956,16 +956,20 @@
         
+   
+ 
 if (nums
@@ -1008,24 +1008,28 @@
             
+    
 return 0;%0A  
@@ -1026,34 +1026,42 @@
 turn 0;%0A        
+  
-%7D%0A
+  %7D%0A    
         boolean%5B
@@ -1102,24 +1102,28 @@
 h%5D;%0A        
+ 
+   
 int answer =
@@ -1122,24 +1122,28 @@
 answer = 0;%0A
+    
         for 
@@ -1167,24 +1167,28 @@
             
+ 
+   
 int count = 
@@ -1186,24 +1186,28 @@
  count = 0;%0A
+    
             
@@ -1229,16 +1229,20 @@
         
+    
 while (j
@@ -1300,16 +1300,20 @@
         
+    
 count++;
@@ -1313,16 +1313,20 @@
 ount++;%0A
+    
         
@@ -1368,16 +1368,20 @@
         
+  
+  
 j = nums
@@ -1389,34 +1389,42 @@
 j%5D;%0A            
-%7D%0A
+    %7D%0A    
             answ
@@ -1453,16 +1453,20 @@
 count);%0A
+    
         
@@ -1471,24 +1471,28 @@
   %7D%0A        
+    
 return answe
@@ -1494,16 +1494,26 @@
 answer;%0A
+        %7D%0A
     %7D%0A%0A%7D

refactor 565