997_Find_The_Town_Judge (qiyuangong#9)

997_Find_The_Town_Judge by @sohel0707

Author: sohel0707

python/997_Find_The_Town_Judge.py

@@ -0,0 +1,21 @@
+class Solution:
+    def findJudge(self, N: int, trust: List[List[int]]) -> int:
+        if N==1:
+            return 1
+        d1={}
+        d2={}
+        for i, j in trust:
+            if j in d1:
+                d1[j]+=1
+            else:
+                d1[j]=1
+            if i in d2:
+                d2[i]+=1
+            else:
+                d2[i]=1
+        for i,j in d1.items():
+            if j==N-1:
+                if i not in d2:
+                    return i
+        return -1
+