LeetCode 565 Array Nesting (置换群个数)

最新推荐文章于 2020-07-23 21:57:00 发布

_TCgogogo_

最新推荐文章于 2020-07-23 21:57:00 发布

阅读量271

点赞数

分类专栏： Leetcode Medium LeetCode 文章标签：置换群

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/101479013

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 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].

题目链接：https://leetcode.com/problems/array-nesting/

题目分析：按照题意模拟即可，用个boolean数组标记

1ms，时间击败100%

class Solution {
    public int arrayNesting(int[] nums) {
        boolean[] vis = new boolean[nums.length];
        int ans = 0;
        for (int i = 0; i < nums.length; i++) {
            if (vis[i]) {
                continue;
            }
            int tmp = 0, pos = nums[i];
            while (!vis[pos]) {
                vis[pos] = true;
                tmp++;
                pos = nums[pos];
            }
            ans = Math.max(ans, tmp);
        }
        return ans;
    }
}