1def findJudge(n, trust):
2    in_degrees = [0] * (n + 1)
3    out_degrees = [0] * (n + 1)
4
5    for a, b in trust:
6        out_degrees[a] += 1
7        in_degrees[b] += 1
8
9    for i in range(1, n + 1):
10        if in_degrees[i] == n - 1 and out_degrees[i] == 0:
11            return i
12    return -1
13

1#include <vector>
2using namespace std;

int findJudge(int n, vector<vector<int>>& trust) {
    vector<int> netTrust(n + 1, 0);

    for (auto& t : trust) {
        int a = t[0], b = t[1];
        netTrust[a]--;
        netTrust[b]++;
    }

    for (int i = 1; i <= n; i++) {
        if (netTrust[i] == n - 1) {
            return i;
        }
    }
    return -1;
}