LeetCode-565. Array Nesting

标签: LeetCode Array
3人阅读 评论(0) 收藏 举报
分类:

Description

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

1.N is an integer within the range [1, 20,000].
2.The elements of A are all distinct.
3.Each element of A is an integer within the range [0, N-1].

Solution 1(C++)

class Solution {
public:
    int arrayNesting(vector<int>& nums) {
        int ans=INT_MIN, cnt, size=nums.size();
        for(int i=0; i<size; i++){
            cnt=0;
            while(nums[i]<size){
                cnt+=1;
                nums[i]+=size;
                i=(nums[i]%size);
            }
            ans=max(ans,cnt);
        }
        return ans;
    }
};

Solution 2(C++)

class Solution {
public:
    int arrayNesting(vector<int>& nums)
    {
        int result = 0;
        for(int i = 0; i < nums.size(); i++){
            if(nums[i] != INT_MAX)
            {
                int beg = nums[i], count = 0;
                while(nums[beg] != INT_MAX)
                {
                    int temp = beg;
                    beg = nums[beg];
                    count++;
                    nums[temp] = INT_MAX;
                }
                result = max(result, count);
            }
        }
        return result;
    }
};

算法分析

这道题不难,找几个例子画一画就知道了,其实最“有序”的是索引与值一一对应好,“无序”就是索引与值不对应,那么数组无论有多大,都肯定存在闭环,而且闭环上的元素,无论从哪一个点开始,都是在闭环上的。所以问题就转换成了找到数组中这样的最大的闭环的长度。

程序分析

参考了 LeetCode-442. Find All Duplicates in an Array。中的方法。

查看评论

对JAVA语言的十个常见误解

对JAVA语言的十个常见误解(辽宁 都 健  编译) JAVA 语 言 自 从 应 用 于 Internet, 迅 速 成 为 全 球 热 点。 它 的 平 台 无 关 性 仿 佛 成 为 解 决 互...
  • Virtual
  • Virtual
  • 2001-01-05 09:27:00
  • 880

leetcode-565. Array Nesting

565. Array Nesting A zero-indexed array A of length N contains all integers from 0 to N-1. Find and...
  • qq_32832023
  • qq_32832023
  • 2017-12-23 10:18:31
  • 189

[LeetCode]565. Array Nesting

https://leetcode.com/problems/array-nesting/#/description 给一个长度N的数组,里面元素为1 ~ N - 1 找到最长的子数组 S[K...
  • gqk289
  • gqk289
  • 2017-05-29 15:58:12
  • 1243

leetcode(565). Array Nesting

problem A zero-indexed array A consisting of N different integers is given. The array contains ...
  • PKU_Jade
  • PKU_Jade
  • 2017-08-01 18:42:50
  • 129

LeetCode * 565. Array Nesting

class Solution { public: int arrayNesting(vector& a) { size_t maxsize = 0; for ...
  • Leo_Luo1
  • Leo_Luo1
  • 2017-06-09 01:36:36
  • 220

【LeetCode】565. Array Nesting 解题报告(Python)

【LeetCode】565. Array Nesting 解题报告(Python) 标签(空格分隔): LeetCode 题目地址:https://leetcode.com/problems/...
  • fuxuemingzhu
  • fuxuemingzhu
  • 2018-03-06 16:48:20
  • 20

LeetCode - 565. Array Nesting

解题代码: classSolution { public:     int arrayNesting(vector&nums) {         int n=nums.size();   ...
  • u014642924
  • u014642924
  • 2017-06-08 16:34:05
  • 270

Array Nesting (第十四周 数组)

Array Nesting (第十四周 数组)
  • lin360580306
  • lin360580306
  • 2017-06-03 18:34:08
  • 274

[3]565. Array Nesting(Java)

A zero-indexed array A consisting of N different integers is given. The array contains all integers ...
  • Crystal_ting
  • Crystal_ting
  • 2017-09-05 19:07:25
  • 131

Array Nesting

A zero-indexed array A consisting of N different integers is given. The array contains all integers ...
  • liuchenjane
  • liuchenjane
  • 2017-05-28 21:19:27
  • 878
    个人资料
    持之以恒
    等级:
    访问量: 1万+
    积分: 2568
    排名: 1万+
    文章存档
    最新评论