565.Array Nesting Java

最新推荐文章于 2021-03-02 07:10:32 发布

屿-Z

最新推荐文章于 2021-03-02 07:10:32 发布

阅读量136

点赞数

分类专栏： LeetCode数组 array tag leetcode java

本文链接：https://blog.csdn.net/qq_31059853/article/details/88072612

版权

LeetCode数组 array tag 同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

leetcode java

5 篇文章 0 订阅

订阅专栏

题目：

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].
依题意可以知道，给定输入的数组有这样的特点：
1、数组中的元素不重复；
2、长度为N的数组中的所有元素大小范围为[0, N-1]。
所以可以得到结论：数组中元素可以按照{A[i], A[A[i]], A[A[A[i]]], ... } 的规则划分为不同的集合，并且所有集合之间都没有交集。
！

解法：因为在集合中出现相同的元素后就停止添加了，将每个走过的路都标记成-1，这样越往后的数字肯定越短，则一碰到-1输出即可。

class Solution {
    public int arrayNesting(int[] nums) {
        int res = 0;
        for(int i = 0 ;i<nums.length;i++){
            int temp = i;
            int cnt = 0;
            while(nums[temp]!=-1){
                cnt++;
                int next = nums[temp];
                nums[temp]=-1;
                temp = next;
                
            }
           res = Integer.max(cnt,res);
        }
        return res;
    }
}