leetcode

0 class Solution {

1 public:

2 int arrayNesting(const vector<int> &nums) const {

3 static int seen[100001];

4

5 const int n = size(nums);

6 memset(seen, 0x00, n * sizeof(int));

7

8 int res = 0;

9 for (int i = 0; i < size(nums); i++) {

10 int crnt = i, size = 0;

11 while (!seen[crnt])

12 size++, seen[crnt] = true, crnt = nums[crnt];

13 res = max(res, size);

14 }

15 return res;

16 }

17 };