LeetCode 6163. 给定条件下构造矩阵

LeetCode 6163. 给定条件下构造矩阵

拓扑排序

class Solution {
public:
    int n;
    vector<int> topsort(vector<vector<int>>& edges)
    {
        vector<vector<int>> g(n + 1);
        vector<int> d(n + 1, 0);
        vector<int> res;
        for(auto&& e : edges)
        {
            g[e[0]].push_back(e[1]);
            d[e[1]] ++;
        }
        queue<int> q;
        for(int i = 1; i <= n; i ++)
            if(d[i] == 0)
                q.push(i);

        while(!q.empty())
        {
            int t = q.front();
            q.pop();
            res.push_back(t);
            for(int i : g[t])
            {
                if(-- d[i] == 0)
                    q.push(i);

            }
        }
        return res;
    }
    int get(vector<int>& arr, int x)
    {
        for(int i = 0; i < n; i ++)
            if(arr[i] == x) 
                return i;
        return -1;
    }
    vector<vector<int>> buildMatrix(int k, vector<vector<int>>& rowConditions, vector<vector<int>>& colConditions) {
        n = k;
        auto row = topsort(rowConditions);
        auto col = topsort(colConditions);

        if(row.size() != n || col.size() != n)
            return {};
        
        vector<vector<int>> res(n, vector<int>(n, 0));
        for(int i = 1; i <= k; i ++)
            res[get(row, i)][get(col, i)] = i;
        return res;
    }
};