一切尽在代码中
class Solution:
def findJudge(self, n: int, trust: List[List[int]]) -> int:
# 入度列表表示相信某人
# 出度表示主动相信某人
# 由题可知,法官不相信任何人,除了法官之外的人都相信法官
indegree = [0 for _ in range(n+1)]
outdegree = [0 for _ in range(n+1)]
for i, j in trust:
indegree[j] += 1
outdegree[i] += 1
for i in range(1,n+1):
# 判断法官的条件
if indegree[i] == n-1 and outdegree[i] == 0:
return i
return -1
关于Go,我刚开始学,太菜了后续满满更新Python和Golang的代码