leetcode 997

class Solution {
public:
    int findJudge(int N, vector<vector<int>>& trust) {
        if(trust.size() == 1)
            return trust[0][1];
        vector<int> dout(N, 0);
        vector<int> din(N, 0);
        for(int i = 0; i < trust.size(); i++)
        {
            din[trust[i][0]]++;
            dout[trust[i][1]]++;
        }
        int res =-1;
        for(int i =0; i <N; i++)
        {
            if(dout[i] == N-1 && din[i] == 0)
            {
                res = i;
                break;
            }
        }
        return res;
    }
};