Add Solution Python

WANGZijian1994 · WANGZijian1994 · commit d4b2203c062a · 2020-05-10T11:00:30.000+02:00
diff --git a/May-LeetCoding-Challenge/10-Find-The-Town-Judge/Find-The-Town-Judge.py b/May-LeetCoding-Challenge/10-Find-The-Town-Judge/Find-The-Town-Judge.py
@@ -7,7 +7,6 @@ def findJudge(self, N: int, trust: List[List[int]]) -> int:
             return -1
         croire = dict() # counting persons that each trusts
         for x in trust:
-            #print(x[0],x[1])
             if x[0] not in croire:
                 croire[x[0]] = set([x[1]])
             else:
