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

思路：

感覺類似於求集合的概念。根據給出的例子，可以發現，5 6 2 0這四個數字無論是從0開始還是從2開始，始終是這四個數字為一個集合，於是就可以用一個標記用來表示

是否已經遍歷過該數字，比如從0開始，依次找到A[0], A[5], A[6], A[2]，將他們依次做標記，就可以避免重復遍歷。

int arrayNesting(vector<int>& nums)
{
  int n = nums.size();
  vector<int>flags(n,false);
  int res =0;
  int num =0;
  for(int i =0;i<n;i++)
  {
    
 
if(flags[i] == true)continue;
    num = 0;
    for(int j = i;flags[j]==false;)
    {
      num++;
      flags[j] = true;
      j = nums[j];
    }
    res = max(res,num);     
  }
  return res;
 }

[leetcode-565-Array Nesting]