leetcode1101

 1 class Solution:
 2     def earliestAcq(self, logs: 'List[List[int]]', N: int) -> int:
 3         def find(x):
 4             if uf[x] != x: 
 5                 return find(uf[x])
 6             else: 
 7                 return x
 8         uf = list(range(N))
 9         n = len(logs)
10         logs = sorted(logs,key=lambda x:[x[0]])
11         for m in range(n):
12             i = logs[m][1]
13             j = logs[m][2]
14             k = logs[m][0]
15             uf[find(i)] = find(j)
16             sets = set(find(i) for i in range(N))
17             cnt = len(sets)
18             if cnt == 1:
19                 return k
20         return -1