g2301_2400.s2392_build_a_matrix_with_conditions.Solution Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation

Java Solution for LeetCode algorithm problems, continually updating

There is a newer version: 1.24

package g2301_2400.s2392_build_a_matrix_with_conditions;

// #Hard #Array #Matrix #Graph #Topological_Sort
// #2022_09_02_Time_9_ms_(97.22%)_Space_50.2_MB_(99.69%)

import java.util.ArrayList;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;

public class Solution {
    // Using topological sort to solve this problem
    public int[][] buildMatrix(int k, int[][] rowC, int[][] colC) {
        // First, get the topo-sorted of row and col
        List row = toposort(k, rowC);
        List col = toposort(k, colC);
        // base case: when the length of row or col is less than k, return empty.
        // That is: there is a loop in established graph
        if (row.size() < k || col.size() < k) {
            return new int[0][0];
        }
        int[][] res = new int[k][k];
        Map map = new HashMap<>();
        for (int i = 0; i < k; i++) {
            // we record the number corresbonding to each column:
            // [number, column index]
            map.put(col.get(i), i);
        }
        // col: 3 2 1
        // row: 1 3 2
        for (int i = 0; i < k; i++) {
            // For each row: we have number row.get(i). And we need to know
            // which column we need to assign, which is from map.get(row.get(i))
            // known by map.get()
            res[i][map.get(row.get(i))] = row.get(i);
        }
        return res;
    }

    private List toposort(int k, int[][] matrix) {
        // need a int[] to record the indegree of each number [1, k]
        int[] deg = new int[k + 1];
        // need a list to record the order of each number, then return this list
        List res = new ArrayList<>();
        // need a 2-D list to be the graph, and fill the graph
        List> graph = new ArrayList<>();
        for (int i = 0; i < k; i++) {
            graph.add(new ArrayList<>());
        }
        // need a queue to do the BFS
        Queue queue = new LinkedList<>();
        // First, we need to establish the graph, following the given matrix
        for (int[] a : matrix) {
            int from = a[0];
            int to = a[1];
            graph.get(from - 1).add(to);
            deg[to]++;
        }
        // Second, after building a graph, we start the bfs,
        // that is, traverse the node with 0 degree
        for (int i = 1; i <= k; i++) {
            if (deg[i] == 0) {
                queue.offer(i);
                res.add(i);
            }
        }
        // Third, start the topo sort
        while (!queue.isEmpty()) {
            int node = queue.poll();
            List list = graph.get(node - 1);
            for (int i : list) {
                if (--deg[i] == 0) {
                    queue.offer(i);
                    res.add(i);
                }
            }
        }
        return res;
    }
}