[leetcode]565. Array Nesting
来源:互联网 发布:java购物商城源码 编辑:程序博客网 时间:2024/06/05 23:46
题目链接:https://leetcode.com/problems/array-nesting/#/description
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: 4Explanation: 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].
class Solution {public: int arrayNesting(vector<int>& nums) { int res=0; for(int i=0;i<nums.size();i++) { if(nums[i]!=INT32_MAX) { int start=nums[i],count=0; while(nums[start]!=INT32_MAX) { int temp=start; start=nums[start]; count++; nums[temp]=INT32_MAX; } res=max(res,count); } } return res; }};
阅读全文
0 0
- [leetcode]565. Array Nesting
- [LeetCode]565. Array Nesting
- LeetCode * 565. Array Nesting
- [LeetCode]565. Array Nesting
- leetcode 565. Array Nesting
- leetcode 565. Array Nesting
- [LeetCode] 565. Array Nesting
- [leetcode]565. Array Nesting
- [leetCode]565. Array Nesting
- LeetCode 565. Array Nesting
- LeetCode 565. Array Nesting
- leetcode 565. Array Nesting
- leetcode 565. Array Nesting
- leetcode-565. Array Nesting
- LeetCode:M-565. Array Nesting
- [Leetcode] 565. Array Nesting 解题报告
- leetcode array nesting
- leetcode(565). Array Nesting
- JAVA之数据库(四)
- 算法博弈:机制设计
- 【计算机网络】网络诊断工具ping的模拟实现之搭建框架
- poj3252(数位dp)
- 模板方法设计模式
- [leetcode]565. Array Nesting
- Leetcode 124. Binary Tree Maximum Path Sum
- 常用类
- anaconda 下多版本Python 安装说明
- 个人不熟悉的面试题目(c++,数据结构)
- 剑指offer--面试题28:对称的二叉树
- 实习遇到的坑....
- hdu 3549 isap
- jQuery中foreach的continue和break : Uncaught SyntaxError: Illegal continue statement