leetcode565. Array Nesting

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].

解法

按照每个元素为首元素遍历一遍，已经遍历过的就不再遍历了，因为在之前链路的中间节点，肯定比之前的链路短。记录每次遍历的count，比较得出最大的count。

public class Solution {
    public int arrayNesting(int[] nums) {
        if (nums == null || nums.length == 0) {
            return -1;
        }

        int len = nums.length;
        int max = 0;
        boolean[] state = new boolean[len];
        for (int i = 0; i < len; i++) {
            if (!state[i]) {
                int count = 1, index = i;
                state[index] = true;
                while (nums[index] != i) {
                    index = nums[index];
                    state[index] = true;
                    count++;
                }
                max = Math.max(max, count);
            }
        }

        return max;
    }
}