Sequence Reconstruction

Check whether the original sequence org can be uniquely reconstructed from the sequences in seqs. The org sequence is a permutation of the integers from 1 to n, with 1 ≤ n ≤ 104. Reconstruction means building a shortest common supersequence of the sequences in seqs (i.e., a shortest sequence so that all sequences in seqs are subsequences of it). Determine whether there is only one sequence that can be reconstructed from seqs and it is the org sequence.

 

Example 1:

Input: org = [1,2,3], seqs = [[1,2],[1,3]]
Output: false
Explanation: [1,2,3] is not the only one sequence that can be reconstructed, because [1,3,2] is also a valid sequence that can be reconstructed.
Example 2:

Input: org = [1,2,3], seqs = [[1,2]]
Output: false
Explanation: The reconstructed sequence can only be [1,2].
Example 3:

Input: org = [1,2,3], seqs = [[1,2],[1,3],[2,3]]
Output: true
Explanation: The sequences [1,2], [1,3], and [2,3] can uniquely reconstruct the original sequence [1,2,3].
Example 4:

Input: org = [4,1,5,2,6,3], seqs = [[5,2,6,3],[4,1,5,2]]
Output: true
 

Constraints:


Solution:

class Solution {
    public boolean sequenceReconstruction(int[] org, List<List<Integer>> seqs) {
        if (seqs.size() == 0) return org.length == 0;
        int n = org.length;
        Map<Integer, List<Integer>> map = new HashMap<>();
        for(int i = 1; i <= n; i++) {
            map.put(i, new ArrayList<>());
        }
        int[] inDegree = new int[n + 1];
        //BuildGraph
        for(List<Integer> s : seqs) {
            if(s.size() == 1) {
                if(s.get(0) <= 0 || s.get(0) > n) return false;
            }
            for (int i = 0; i < s.size() - 1; i ++) {
                if (s.get(i) <= 0 || s.get(i) > n || s.get(i + 1) <= 0 || s.get(i + 1) > n) {
                    return false;
                }
                map.get(s.get(i)).add(s.get(i + 1));
                inDegree[s.get(i + 1)] ++;
            }
        }

        Queue<Integer> q = new ArrayDeque();
        for (int i = 1; i < inDegree.length; i++) {
            if (inDegree[i] == 0) {
                q.add(i);
            }
            if (q.size() > 1) return false;
        }
        int idx = 0;
        while (!q.isEmpty()) {
            int curr = q.poll();
            if (idx >= org.length || org[idx ++] != curr) {
                return false;
            }
            for (int next : map.get(curr)) {
                inDegree[next] --;
                if (inDegree[next] == 0) {
                    q.offer(next);
                }
            }
            if (q.size() > 1) return false;
        }
        return idx == org.length;
    }
}