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 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);
            }
            return answer;
        }
    }

}

@@ -33,824 +33,8 @@
 s;%0A%0A
-/**%0A * 565. Array Nesting%0A *%0A A zero-indexed array A consisting of N different integers is given. The array contains all integers in the range %5B0, N - 1%5D.%0A%0A Sets S%5BK%5D for 0 %3C= K %3C N are defined as follows:%0A%0A S%5BK%5D = %7B A%5BK%5D, A%5BA%5BK%5D%5D, A%5BA%5BA%5BK%5D%5D%5D, ... %7D.%0A%0A Sets S%5BK%5D are finite for each K and should NOT contain duplicates.%0A%0A Write a function that given an array A consisting of N integers, return the size of the largest set S%5BK%5D for this array.%0A%0A Example 1:%0A Input: A = %5B5,4,0,3,1,6,2%5D%0A Output: 4%0A Explanation:%0A A%5B0%5D = 5, A%5B1%5D = 4, A%5B2%5D = 0, A%5B3%5D = 3, A%5B4%5D = 1, A%5B5%5D = 6, A%5B6%5D = 2.%0A%0A One of the longest S%5BK%5D:%0A S%5B0%5D = %7BA%5B0%5D, A%5B5%5D, A%5B6%5D, A%5B2%5D%7D = %7B5, 6, 2, 0%7D%0A Note:%0A N is an integer within the range %5B1, 20,000%5D.%0A The elements of A are all distinct.%0A Each element of array A is an integer within the range %5B0, N-1%5D.%0A */%0A
 publ

refactor 565