【Leetcode_easy】997. Find the Town Judge

problem

997. Find the Town Judge

solution:

class Solution {
public:
   
    int findJudge(int N, vector<vector<int>>& trust) {
        vector<int> balance(N+1);
        for(auto t:trust) { balance[t[0]]--; balance[t[1]]++; }
        for(int i=1; i<=N; i++)
        {
            if(balance[i]==N-1) return i;
        }
        return -1;
    }
};

 

参考

1. Leetcode_easy_997. Find the Town Judge;

完