跳转至

喧闹和富有⚓︎

Leetcode题目链接

描述⚓︎

详见中文题目链接。

解答⚓︎

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
class Solution {
public:
    vector<int> loudAndRich(vector<vector<int>>& richer, vector<int>& quiet) {
        int n = quiet.size();
        vector<vector<int>> edges(n);
        vector<int> inDegree(n, 0);

        for (const auto& edge : richer) {
            edges[edge[0]].push_back(edge[1]);
            inDegree[edge[1]]++;
        }

        queue<int> que;
        for (int i = 0; i < n; i++) {
            if (inDegree[i] == 0)
                que.push(i);
        }

        vector<int> res(n);
        for (int i = 0; i < n; i++)
            res[i] = i;

        while (!que.empty()) {
            int current = que.front();
            que.pop();

            for (auto v : edges[current]) {
                if (quiet[res[current]] < quiet[res[v]])
                    res[v] = res[current];
                if (--inDegree[v] == 0)
                    que.push(v);
            }
        }

        return res;
    }
};