Leetcode 并查集模板
class UnionFind: def __init__(self, n): self.count = n self.p = [i for i in range(n)] def parent(self, i): root = i while self.p[root] != root: root = self.p[root] while self.p[i] != i:





