大连网站优化公司域名查询访问
题目：
题解：
class Solution:def arrayNesting(self, nums: List[int]) -> int:ans, n = 0, len(nums)for i in range(n):cnt = 0while nums[i] < n:num = nums[i]nums[i] = ni = numcnt += 1ans = max(ans, cnt)return ans
题目：
题解：
class Solution:def arrayNesting(self, nums: List[int]) -> int:ans, n = 0, len(nums)for i in range(n):cnt = 0while nums[i] < n:num = nums[i]nums[i] = ni = numcnt += 1ans = max(ans, cnt)return ans