We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f0ef403 commit 92746efCopy full SHA for 92746ef
medium/number-of-provinces/number-of-provinces.py
@@ -0,0 +1,23 @@
1
+class Solution:
2
+ def findCircleNum(self, isConnected: List[List[int]]) -> int:
3
+ n = len(isConnected)
4
+ parent = [i for i in range(n)]
5
+ def find(a):
6
+ if parent[a] != a:
7
+ parent[a] = find(parent[a])
8
+ return parent[a]
9
+ def union(a, b):
10
+ pa, pb = find(a), find(b)
11
+ if pa == pb:
12
+ return 0
13
+ if pa < pb:
14
+ parent[pb] = pa
15
+ else:
16
+ parent[pa] = pb
17
+
18
+ for i in range(n):
19
+ for j, edge in enumerate(isConnected[i]):
20
+ if edge != 1:
21
+ continue
22
+ union(i, j)
23
+ return len(set([find(i) for i in range(n)]))
0 commit comments