leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0997.cpp (449B)

0 class Solution { 1 public: 2 int findJudge(int n, vector<vector<int>> &trust) { 3 if (n == 1 && trust.empty()) return 1; 4 5 vector<int> trusted(n + 1, 0); 6 unordered_set<int> trusting; 7 8 for (auto &p : trust) { 9 trusting.insert(p[0]); 10 trusted[p[1]]++; 11 } 12 13 for (int i = 1; i <= n; i++) 14 if (trusted[i] == n - 1 && !trusting.count(i)) return i; 15 16 return -1; 17 } 18 };