comefrom: <doocs>0997.Find the Town Judge_1.py
code: def findJudge( n: int, trust: List[List[int]]) -> int:
      N = 1001
      c1, c2 = [0] * N, [0] * N
      for a, b in trust:
          c1[a] += 1
          c2[b] += 1
      for i in range(1, N):
          if c1[i] == 0 and c2[i] == n - 1:
              return i
      return -1
masked: def sample_funcname ( var_0 : int , var_2 : List [ List [ int ] ] ) -> int :
      var_5 = 1001
      var_7 , var_8 = [ 0 ] * var_5 , [ 0 ] * var_5
      for var_9 , var_10 in var_2 :
          var_7 [ var_9 ] += 1
          var_8 [ var_10 ] += 1
      for var_13 in range ( 1 , var_5 ) :
          if var_7 [ var_13 ] == 0 and var_8 [ var_13 ] == var_0 - 1 :
              return var_13
      return - 1
  