In a town, there are N people labelled 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. Ther…

class Solution: def findJudge(self, N: int, trust: 'List[List[int]]') -> int: if N==1 and len(trust)==0: return 1 s = list(range(1,N+1)) d = {} for t in range(len(trust)): a1 = trust[t][0] a2 = trust[t][1] if a1 in s: s.remove(a1) if a2 in d.keys():…

题目 在一个小镇里,按从 1 到 N 标记了 N 个人.传言称,这些人中有一个是小镇上的秘密法官. 如果小镇的法官真的存在,那么: 小镇的法官不相信任何人. 每个人(除了小镇法官外)都信任小镇的法官. 只有一个人同时满足属性 1 和属性 2 . 给定数组 trust,该数组由信任对 trust[i] = [a, b] 组成,表示标记为 a 的人信任标记为 b 的人. 如果小镇存在秘密法官并且可以确定他的身份,请返回该法官的标记.否则,返回 -1. 示例 1: 输入:N = 2, trust =…