🐜 Study: 네트워크 (#51)

Author: ing-eoking

ing-eoking/네트워크.py

@@ -0,0 +1,8 @@
+def solution(n, computers):
+    root = list(range(n))
+    find = lambda x: x if x == root[x] else find(root[x])
+    for i in range(n):
+        for j in range(n):
+            if computers[i][j] == 0 or i == j: continue
+            if (a := find(i)) != (b := find(j)): root[b] = a
+    return len(set(find(i) for i in range(n)))