Array Nesting LeetCode solution in Java

1
class Solution {
2
  public int arrayNesting(int[] nums) {
3
    int res = 0;
4
    boolean[] visited = new boolean[nums.length];
5
    for (int i = 0; i < nums.length; i++) {
6
      if (!visited[i]) {
7
        int len = dfs(nums, i, visited);
8
        res = Math.max(res, len);
9
      }
10
    }
11
    return res;
12
  }
13

14
  public int dfs(int[] nums, int i, boolean[] visited) {
15
    if (visited[i]) return 0;
16
    visited[i] = true;
17
    return 1 + dfs(nums, nums[i], visited);
18
  }
19
}