LeetCode-565. Array Nesting

Description

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

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

Solution 1(C++)

class Solution {
public:
    int arrayNesting(vector<int>& nums) {
        int ans=INT_MIN, cnt, size=nums.size();
        for(int i=0; i<size; i++){
            cnt=0;
            while(nums[i]<size){
                cnt+=1;
                nums[i]+=size;
                i=(nums[i]%size);
            }
            ans=max(ans,cnt);
        }
        return ans;
    }
};

Solution 2(C++)

class Solution {
public:
    int arrayNesting(vector<int>& nums)
    {
        int result = 0;
        for(int i = 0; i < nums.size(); i++){
            if(nums[i] != INT_MAX)
            {
                int beg = nums[i], count = 0;
                while(nums[beg] != INT_MAX)
                {
                    int temp = beg;
                    beg = nums[beg];
                    count++;
                    nums[temp] = INT_MAX;
                }
                result = max(result, count);
            }
        }
        return result;
    }
};

算法分析

这道题不难，找几个例子画一画就知道了，其实最“有序”的是索引与值一一对应好，“无序”就是索引与值不对应，那么数组无论有多大，都肯定存在闭环，而且闭环上的元素，无论从哪一个点开始，都是在闭环上的。所以问题就转换成了找到数组中这样的最大的闭环的长度。

程序分析

参考了 LeetCode-442. Find All Duplicates in an Array。中的方法。