leetcode 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:

1. N is an integer within the range [1, 20,000].
2. The elements of A are all distinct.
3. Each element of array A is an integer within the range [0, N-1].

因为这当中会有若干个循环，我就用了类似于判圈法的方法，用两个指针循环计算长度，同时用另一个数组保存是否已读取的信息，运行时间上不是很快， 57ms

public class Solution {
    public int arrayNesting(int[] nums) {
        boolean[] visited = new boolean[nums.length];
        int max = 0, cnt = 0;
        for(int i=0; i<nums.length; i++){
            if(visited[i]==false){
                int x=nums[i], y=nums[i];
                do{
                    x = nums[x];
                    y = nums[nums[y]];
                    visited[x] = visited[y] = true;
                    cnt++;
                }while(x!=y);
                if(cnt>max) max = cnt;
                cnt = 0;
            }
        }
        return max;
    }
}

判断是否已遍历还是可以在原数组上取反，不必新建数组

还有判断上也不需要用两个指针，直接与 i 比较即可

别人的写法

public class Solution {
    public int arrayNesting(int[] nums) {
    int res = 0;
    for (int i=0;i<nums.length;i++) {
        if (nums[i] < 0) continue;
        int length = 1, val = nums[i];
        while (Math.abs(val) != i) {
            length++;
            val = nums[Math.abs(val)];
            nums[Math.abs(val)] *= -1;
        }
        res = Math.max(res, length);
    }
    return res;
}
}