LeetCode 997 Find the Town Judge 寻找小镇法官 C语言

997. Find the Town Judge

In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is secretly the town judge.

If the town judge exists, then:

The town judge trusts nobody.
Everybody (except for the town judge) trusts the town judge.
There is exactly one person that satisfies properties 1 and 2.
You are given trust, an array of pairs trust[i] = [a, b] representing that the person labelled a trusts the person labelled b.

If the town judge exists and can be identified, return the label of the town judge. Otherwise, return -1.

Example 1:

Input: N = 2, trust = [[1,2]]
Output: 2

Example 2:

Input: N = 3, trust = [[1,3],[2,3]]
Output: 3

Example 3:

Input: N = 3, trust = [[1,3],[2,3],[3,1]]
Output: -1

Example 4:

Input: N = 3, trust = [[1,2],[2,3]]
Output: -1

Example 5:

Input: N = 4, trust = [[1,3],[1,4],[2,3],[2,4],[4,3]]
Output: 3

Note:

1 <= N <= 1000
trust.length <= 10000
trust[i] are all different
trust[i][0] != trust[i][1]
1 <= trust[i][0], trust[i][1] <= N

思路：
1.数组[a,b]表示小镇居民a信任小镇居民b。
2.法官被所有人信任，除了自己。
3.小镇除了法官，所有人都信任法官。
4.所以对于有N个居民的小镇来书，若是存在法官，则信任法官的人有N-1人。也就是说，法官在[a,b]数组堆中的b位置上会出现N-1次。
5.且法官只会存在1个，所以不用考虑{[1,2],[1,3]}这样的情况，也不会出现这样的数据。
6.定义一个空数组count，count数组用于统计每位居民在a，b位上的次数；若在a位置上出现一次则-1一次，b位置上出现一次则+1一次。
7.最后count数组中值为N-1的位置+1即为所求的法官的标号。假设count[i]==N-1，则i+1即为所求的法官的标号。
---------------------------------------------------代码如下----------------------------------------------------------

int findJudge(int N, int** trust, int trustSize, int* trustColSize){
    int count[N];//count用于统计每位居民在a，b位上的次数；若在a位置上出现一次则-1一次，b位置上出现一次则+1一次；
    memset(count,0,sizeof(count));
    
    for(int i=0;i<trustSize;i++){
        count[trust[i][0]-1]--;
        count[trust[i][1]-1]++;
    }
    for(int i=0;i<N;i++){
        if(count[i]==N-1){
            return i+1;
        }
    }
    return -1;
}