-
Notifications
You must be signed in to change notification settings - Fork 0
/
FindTheTownJudge.java
50 lines (42 loc) · 1.26 KB
/
FindTheTownJudge.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/*
Find the Town Judge
In a town, there are n people labeled 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 an array trust where trust[i] = [ai, bi] representing that the person labeled ai trusts the person labeled bi.
Return the label of the town judge if the town judge exists and can be identified, or return -1 otherwise.
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
Constraints:
1 <= n <= 1000
0 <= trust.length <= 104
trust[i].length == 2
All the pairs of trust are unique.
ai != bi
1 <= ai, bi <= n
*/
class FindTheTownJudge {
public int findJudge(int n, int[][] trust) {
int[]netTrustGains=new int[n+1];
for(int[]i:trust){
netTrustGains[i[0]]--;
netTrustGains[i[1]]++;
}
int judge=-1;
for(int i=1;i<=n;i++){
if(netTrustGains[i]==n-1){
judge=i;
}
}
return judge;
}
}