<medium>LeetCode Problem -- 565. Array Nesting

• 描述：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}

• 分析：给定一个值从0～n-1的数组，根据S[i] = {A[i], A[A[i]], A[A[A[i]]], … }构造字数组，要求找到最大子数组的长度。
• 思路一：使用遍历求解。

class Solution {
public:
    int arrayNesting(vector<int>& nums) {
        int max_size = 0;
        for (int i = 0; i < nums.size(); i++) {
            int cur_size = 0;
            for (int k = i; nums[k] >= 0; cur_size++) {
                k = nums[k];
            }
            max_size = max(max_size, cur_size);
        }
        return max_size;
    }
};

很不幸，会超时，分析原因应该是走了之前走过的位置，因此将之前走过的点的值设置为-1。

• 思路二：将走过的点设置为-1。

class Solution {
public:
    int arrayNesting(vector<int>& nums) {
        int max_size = 0;
        for (int i = 0; i < nums.size(); i++) {
            int cur_size = 0;
            for (int k = i; nums[k] >= 0; cur_size++) {
                int temp = nums[k];
                nums[k] = -1;
                k = temp;
            }
            max_size = max(max_size, cur_size);
        }
        return max_size;
    }
};

• 总结：这道题有趣的地方在于，这个最长数组其实是循环的，就是不论从那个位置出发得到的最大数组长度都是相同的，因此可以把走过的数组的值置为-1而不会影响最终的值，但是这样会污染原数组-_-