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. If a trust relationship does not exist in the trust array, then such a trust relationship does not exist.
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
2Person 2 trusts nobody, and person 1 trusts person 2, so person 2 is the town judge.
Example 2
Input
n = 3, trust = [[1,3],[2,3]]Output
3Person 3 trusts nobody, and both other people trust person 3, so person 3 is the town judge.
Constraints
- 1 <= n <= 1000
- 0 <= trust.length <= 10^4
- trust[i].length == 2
- All the pairs of trust are unique.
- ai != bi
- 1 <= ai, bi <= n