Find the Town Judge 🚞
In a town, there are
n people labeled from
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[i] = [ai, bi] representing that the person labeled
ai trusts the person labeled
Return the label of the town judge if the town judge exists and can be identified, or return
Input: n = 2, trust = [[1,2]]
Input: n = 3, trust = [[1,3],[2,3]]
Input: n = 3, trust = [[1,3],[2,3],[3,1]]
1 <= n <= 1000
0 <= trust.length <= 104
trust[i].length == 2
- All the pairs of
ai != bi
1 <= ai, bi <= n
Time Complexity O(n*m) where m is the length of the trust array
Space Complexity O(1)
Time Complexity O(n+m)
Space Complexity O(n)
Do you see that green follow button? 🐌