找到嵌套数组的最大个数 Array Nesting

为什么80%的码农都做不了架构师？>>>   

问题：

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].

解决：

①  找嵌套数组的最大个数，给的数组总共有n个数字，范围均在[0, n-1]之间。只要找到和起始位置相同的数字位置，就可以结束本次查找。dfs查找。

class Solution { //40ms
    public int arrayNesting(int[] nums) {
        int len = nums.length;
        int res = Integer.MIN_VALUE;
        boolean[] isvisited = new boolean[len];
        for (int i = 0;i < len;i ++){
            if (isvisited[nums[i]]) continue;
            res = Math.max(res,dfs(nums,i,isvisited));
        }
        return res;
    }
    public int dfs(int[] nums,int i,boolean[] isvisited){
        int j = i;
        int count = 0;
        while(count == 0 || j != i){
            isvisited[j] = true;
            j = nums[j];
            count ++;
        }
        return count;
    }
}

② 上面的简化。

class Solution {//39ms
    public int arrayNesting(int[] nums) {
        int len = nums.length;
        int res = Integer.MIN_VALUE;
        boolean[] isvisited = new boolean[len];
        for (int i = 0;i < len;i ++){
            if (isvisited[nums[i]]) continue;
            int count = 0;
            int j = i;
            while(count == 0 || j != i){
                isvisited[j] = true;
                j = nums[j];
                count ++;
            }
            res = Math.max(res,count);
        }
        return res;
    }
}

③ 进化版

class Solution { //49ms
    public int arrayNesting(int[] nums) {
        int max = Integer.MIN_VALUE;
        for(int i = 0;i < nums.length;i ++){
            if(nums[i] != -1){
                int count = 0;
                int j = i;
                while(nums[j] != -1){
                    count ++;
                    int k = nums[j];
                    nums[j] = -1;
                    j = k;
                }
                max = Math.max(max,count);
            }
        }
        return max;
    }
}

④ 我们并不需要专门的数组来记录数组是否被遍历过，而是我们在遍历的过程中，将其交换到其应该出现的位置上，因为如果某个数出现在正确的位置上，那么它一定无法组成嵌套数组，这样就相当于我们标记了其已经访问过了。

class Solution { //79ms
    public int arrayNesting(int[] nums) {
        int len = nums.length;
        int res = Integer.MIN_VALUE;
        for (int i = 0;i < len;i ++){
            int count = 1;
            while(nums[i] != i && nums[i] != nums[nums[i]]){
                swap(nums,i,nums[i]);
                count ++;
            }
            res = Math.max(res,count);
        }
        return res;
    }
    public void swap(int[] nums,int i,int j){
        int tmp = nums[i];
        nums[i] = nums[j];
        nums[j] = tmp;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1605402