leetcode565+判断数组的最大环大小

https://leetcode.com/problems/array-nesting/description/

class Solution {
public:
    int arrayNesting(vector<int>& nums) {
        int n = nums.size();
        if(n==0) return 0;
        bool visited[n];
        memset(visited, false, sizeof(visited));
        int maxCircle = 0, tmpCircle = 0;
        for(int i=0; i<n; i++){
            tmpCircle = 0;
            int j = i;
            while (!visited[j]) {
                visited[j] = true;
                tmpCircle += 1;
                j = nums[j];
            }
            if(tmpCircle > maxCircle){
                maxCircle = tmpCircle;
            }
        }
        return maxCircle;
    }
};