【Leetcode_easy】997. Find the Town Judge

problem

solution:

class Solution {

public:

    int findJudge(int N, vector<vector<int>>& trust) {

        vector<int> balance(N+);

        for(auto t:trust) { balance[t[]]--; balance[t[]]++; }

        for(int i=; i<=N; i++)

        {

            if(balance[i]==N-) return i;

        }

        return -;

    }

};

参考

1. Leetcode_easy_997. Find the Town Judge;

完

巴特西

【Leetcode_easy】997. Find the Town Judge

最新文章

热门文章