class Solution:
def findJudge(self, N: int, trust: List[List[int]]) -> int:
l1 = []
l2 = []
for i in range(len(trust)):
l1.append(trust[i][0])
l2.append(trust[i][1])
for i in range(1, N+1):
if(i not in l1 and l2.count(i) == N-1):
return i
return -1
997. 找到小镇的法官
最新推荐文章于 2023-12-04 20:29:16 发布