565. Array Nesting 阵列嵌套
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了565. Array Nesting 阵列嵌套，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1343字，纯文字阅读大概需要2分钟。
内容图文
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: 6Explanation: 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].
-
/**
-
* @param {number[]} nums
-
* @return {number}
-
*/
-
var
arrayNesting
=
function
(
nums
)
{
-
let res
=
0
,
set
=
new
Set
();
//因为集合S会成环，因此可以用set存储遍历过的index
-
for
(
let i
=
0
;
i
<
nums
.
length
;
i
++)
{
-
let curIndex
=
i
,
count
=
0
;
-
while
(!
set
.
has
(
curIndex
))
{
-
set
.
add
(
curIndex
);
-
curIndex
=
nums
[
curIndex
];
-
count
++;
-
}
-
res
=
Math
.
max
(
res
,
count
);
-
}
-
return
res
;
-
};
-
-
//let arr = [5, 4, 0, 3, 1, 6, 2];
-
let arr
=
[
1
,
2
,
3
,
4
,
5
,
0
]
-
console
.
log
(
arrayNesting
(
arr
));
原文：http://www.cnblogs.com/xiejunzhao/p/8045107.html
内容总结
以上是互联网集市为您收集整理的565. Array Nesting 阵列嵌套全部内容，希望文章能够帮你解决565. Array Nesting 阵列嵌套所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。