Package g0501_0600.s0565_array_nesting

Class Solution

java.lang.Object

g0501_0600.s0565_array_nesting.Solution

public class Solution
extends Object

565 - Array Nesting.<p>Medium</p> <p>You are given an integer array <code>nums</code> of length <code>n</code> where <code>nums</code> is a permutation of the numbers in the range <code>[0, n - 1]</code>.</p> <p>You should build a set <code>s[k] = {nums[k], nums[nums[k]], nums[nums[nums[k]]], ... }</code> subjected to the following rule:</p> <ul> <li>The first element in <code>s[k]</code> starts with the selection of the element <code>nums[k]</code> of <code>index = k</code>.</li> <li>The next element in <code>s[k]</code> should be <code>nums[nums[k]]</code>, and then <code>nums[nums[nums[k]]]</code>, and so on.</li> <li>We stop adding right before a duplicate element occurs in <code>s[k]</code>.</li> </ul> <p>Return <em>the longest length of a set</em> <code>s[k]</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [5,4,0,3,1,6,2]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong></p> <p>nums[0] = 5, nums[1] = 4, nums[2] = 0, nums[3] = 3, nums[4] = 1, nums[5] = 6, nums[6] = 2.</p> <p>One of the longest sets s[k]:</p> <p>s[0] = {nums[0], nums[5], nums[6], nums[2]} = {5, 6, 2, 0}</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [0,1,2]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>0 <= nums[i] < nums.length</code></li> <li>All the values of <code>nums</code> are <strong>unique</strong>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	arrayNesting(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

arrayNesting

public int arrayNesting(int[] nums)