2022.7.23 ------ leetcode. Jianzhi offer.115

    int V;// Number of vertices 
    Deque<Integer>[] adj;// Adjacency list 
    int[] in;// Store the penetration of each vertex 
    // Add an edge 
    public void addEdge(int v,int w){
        if(!adj[v].contains(w)){
            adj[v].offer(w);
            in[w]++;
        }
    }

     public boolean sequenceReconstruction(int[] nums, int[][] ss) {
         V = nums.length;
         in=new int[V+1];
        adj = new ArrayDeque[V+1];
        for (int i = 0; i < adj.length; i++) {
            adj[i]=new ArrayDeque<>();
        }
        // Drawing 
        for(int[] s:ss){
            if(s.length==1)
                continue;
            for(int i=1;i<s.length;i++)
                addEdge(s[i-1],s[i]);
        }
        return topologicalSort1();

     }
     public boolean topologicalSort1(){
        Deque<Integer> q=new ArrayDeque<>();
        // The degree of engagement is 0 The vertices of join the queue 
        for (int i = 1; i <= V; i++) {
            if(in[i]==0)
                q.add(i);
        }
        // If nums only , Every time q There can only be one vertex in 
        if(q.size()>1)
            return false;
        while(!q.isEmpty()){
            int v=q.poll();// Take out the penetration 0 The summit of 
            for (int w:adj[v]) {
                in[w]--;//v Point to the vertex in degrees minus 1
                if(in[w]==0)
                    q.add(w);
            }
            if(q.size()>1)
                return false;
        }
        return true;// If you can be sure to include [1,n] The unique sequence of , Must be the shortest 
    }