[leetcode/python3] 565. Array Nesting

https://leetcode.com/problems/array-nesting/

Array Nesting - LeetCode

class Solution:
    def arrayNesting(self, nums: List[int]) -> int:
        result = 0
        
        for index in range(0, len(nums)):
            length = 0
            while nums[index] != -1:
                length += 1
                
                temp = nums[index]
                nums[index] = -1
                index = temp
            else:
                result = max(result, length)
        
        return result