Array Nesting LeetCode solution in C++

1
class Solution {
2
 public:
3
  int dfs(vector<int> &nums, int ind, int arr[], int res) {
4
    if (arr[ind] == 1) return res;
5
    res++;
6
    arr[ind] = 1;
7
    return dfs(nums, nums[ind], arr, res);
8
  }
9
  int arrayNesting(vector<int> &nums) {
10
    int arr[nums.size()], ans = 0;
11
    for (int i = 0; i < nums.size(); i++) arr[i] = 0;
12
    for (int i = 0; i < nums.size(); i++) {
13
      int res = dfs(nums, i, arr, 0);
14
      ans = max(res, ans);
15
    }
16
    return ans;
17
  }
18
};