In a town, there are
N
people labelled from1
toN
. 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 pairstrust[i] = [a, b]
representing that the person labelleda
trusts the person labelledb
.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: 2Example 2:
Input: N = 3, trust = [[1,3],[2,3]] Output: 3Example 3:
Input: N = 3, trust = [[1,3],[2,3],[3,1]] Output: -1Example 4:
Input: N = 3, trust = [[1,2],[2,3]] Output: -1Example 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 differenttrust[i][0] != trust[i][1]
1 <= trust[i][0], trust[i][1] <= N
public int findJudge(int N, int[][] trust) {
label: for (int i = 1; i <= N; i++) {
boolean out = true;
boolean beTrusted = false;
for (int[] arr : trust) {
if (arr[0] == i) {
out &= false;
continue label;
} else {
out &= true;
}
}
if (out) {
int count = 0;
for (int[] arr : trust) {
if (arr[1] == i) {
count++;
}
}
if (count+1 == N) return i;
}
}
return -1;
}