May_10_Find_the_Town_Judge.cpp

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