原题:
A zero-indexed array A consisting of N different integers is given. The array contains all integers in the range [0, N - 1].
Sets S[K] for 0 <= K < N are defined as follows:
S[K] = { A[K], A[A[K]], A[A[A[K]]], … }.
Sets S[K] are finite for each K and should NOT contain duplicates.
Write a function that given an array A consisting of N integers, return the size of the largest set S[K] for this array.
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 array A is an integer within the range [0, N-1].
思路:其实本题就是求数组中最大环的长度。比如,题目中的例子:A[0] = 5, A[1] = 4, A[2] = 0, A[3] = 3, A[4] = 1, A[5] = 6, A[6] = 2。该例子中一共形成了三个环:0->5->6->2->0,4->1->4;3->3。长度最长的为4。题目提示中有两句话特别重要,一是数组的所有元素都不相同,二是数组的所有元素值为 [0, N-1],这样就完全与数组下标对应。会不会存在这样的情况呢?0->5->6->2->5。显然不会!因为不可能有两个不同下标同时指向5,不然会与提示的两个条件矛盾!所以任何一个元素有且仅存在于一个环中。另外,在找环的过程中,0->5->6->2->0,5->6->2->0->5是完全等价的,所以与开始遍历的顺序无关。因此,用一个visited的数组标记元素是否被访问过,从没被访问过的元素开始找环并标记,时间复杂度o(n)。
代码:
class Solution {
public:
int arrayNesting(vector<int>& nums) {
int n=nums.size();
if(n==0) return 0;
bool visited[n];
memset(visited,false,sizeof(visited));
int maxCircle=0,tmpCircle=0;
for(int i=0;i<n;i++){
tmpCircle=0;
int j=i;
while(!visited[j]){
visited[j]=true;
tmpCircle++;
j=nums[j];
}
if(tmpCircle>maxCircle)
maxCircle=tmpCircle;
}
return maxCircle;
}
};