Leetcode 997. Find the Town Judge

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Find the Town Judge

2. Solution

  • Version 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution:
def findJudge(self, N, trust):
if N == 1:
return 1
if len(trust) < N - 1:
return -1
judge = {}
people = {}
for pair in trust:
people[pair[0]] = people.get(pair[0], 0) + 1
judge[pair[1]] = judge.get(pair[1], 0) + 1
for key, value in judge.items():
if value == N - 1 and key not in people:
return key
return -1
  • Version 2
1
2
3
4
5
6
7
8
9
10
11
class Solution:
def findJudge(self, N, trust):
count = [0] * (N + 1)
for pair in trust:
count[pair[0]] -= 1
count[pair[1]] += 1
for i in range(1, len(count)):
if count[i] == N - 1:
return i
return -1

Reference

  1. https://leetcode.com/problems/find-the-town-judge/submissions/
如果有收获,可以请我喝杯咖啡!