leetcode 刷题报告 1584 Min Cost to Connect All Points python 并查集 MST

You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi].

The cost of connecting two points [xi, yi] and [xj, yj] is the manhattan distance between them: |xi - xj| + |yi - yj|, where |val| denotes the absolute value of val.

Return the minimum cost to make all points connected. All points are connected if there is exactly one simple path between any two points.
首先这题是个最小生成树 MST Minimun spanning tree 有两种解法， prim和 Kruskal’s 两种。 这里就看 kruskal，这个算法一句精髓就是 从 边出发。 我们计算出 两个点 之间的距离。

然后把边长排序，一条条加， 如果两个点 已经在一个集合里面了，就不用加这条边了。 没的话就把这条边加上，把两个点连起来。 具体怎么看点在不在一个集合，怎么去连两个点。用并查集来做。

class UnionFind():
    def __init__(self, n):
        self.parent = list(range(n))
    
    def find(self