Leetcode 565. Array Nesting

最新推荐文章于 2024-06-17 10:58:19 发布

转载最新推荐文章于 2024-06-17 10:58:19 发布 · 132 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zuotongbin/p/10219981.html

文章标签：

#数据结构与算法

本文解析了LeetCode上的一道中等难度题目——数组嵌套问题，介绍了如何寻找最长的不重复元素序列，并提供了C++实现代码。算法采用O(n)时间复杂度和O(1)空间复杂度，通过标记已访问元素来避免重复计算。

题目

链接：https://leetcode.com/problems/array-nesting/

Level: Medium

Discription:
A zero-indexed array A of length N contains all integers from 0 to N-1. Find and return the longest length of set S, where S[i] = {A[i], A[A[i]], A[A[A[i]]], ... } subjected to the rule below.

Suppose the first element in S starts with the selection of element A[i] of index = i, the next element in S should be A[A[i]], and then A[A[A[i]]]… By that analogy, we stop adding right before a duplicate element occurs in S.

Example 1:

Input: A = [5,4,0,3,1,6,2]
Output: 4
Explanation: 
A[0] = 5, A[1] = 4, A[2] = 0, A[3] = 3, A[4] = 1, A[5] = 6, A[6] = 2.

One of the longest S[K]:
S[0] = {A[0], A[5], A[6], A[2]} = {5, 6, 2, 0}

Note:

N is an integer within the range [1, 20,000].
The elements of A are all distinct.
Each element of A is an integer within the range [0, N-1].

代码

class Solution{
public:
    int arrayNesting(vector<int>& nums) {
        int temp=0,ret=0;
        int b=0;
        int cache=0;
        for(int i=0;i<nums.size();i++)
        {
            b = i;
            temp = 0;
            while(nums[b]!=-1)
            {
                cache=b;
                b=nums[b];
                nums[cache]=-1;
                temp++;  
            }
             ret = max(ret,temp);    
        }
        return ret;
    }
};