[LeetCode] 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}

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].

输入是一个有范围的数组，数组中的每一个值作为index 不断重复索引，直到值发生重复。要求求出最长路径的大小。
本题的本质是一个dfs 搜索问题。由于数组中的取值有最大值，所以使用一维数组记录访问过的位置。以数组中的每一个点作为起始点开始dfs 搜索，如果以及访问过的元素则直接跳过。遍历一遍之后找到最长路径。

C++ 实现

class Solution {
public:
    int arrayNesting(vector<int>& nums) {
        int res = 0;
        vector<bool> visited(nums.size(), false);
        for (int i = 0; i < nums.size(); i++)
        {
            if (!visited[i])
            {
                int j = i;
                int count = 0;
                while(count == 0 || i != j)
                {
                    visited[j] = true;
                    j = nums[j];
                    count++;
                }
                res = max(res, count);
            }
        }
        return res;
    }
};