思路:一如既往的模拟
代码
int findJudge(int n, vector<vector<int>>& trust) {
int size = trust.size();
vector<int> rec(n + 5);
for (int i = 0; i < size; i++) {
cout<<trust[i][0]<<" ";
rec[trust[i][0]] = -1;
rec[trust[i][1]]++;
}
for (int i = 1; i <= n; i++) {
if (rec[i] == n - 1) {
return i;
}
}
return -1;
}