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:
You are given an array trust where trust[i] = [a_i, b_i] representing that the person labeled a_i trusts the person labeled b_i. 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.
1 <= n <= 10000 <= trust.length <= 10^4trust[i].length == 2trust are uniquea_i != b_i1 <= a_i, b_i <= nn = 2, trust = [[1,2]]2n = 3, trust = [[1,3],[2,3]]3n = 3, trust = [[1,3],[2,3],[3,1]]-1