JS刷题-并查集

JS刷题-并查集

并查集数据结构

    class UnionFind {
        // 初始化需要结点的数量
        constructor(n) {
            // 记录连通分量的数量
            this.count = n
            this.parent = new Array(n).fill(0).map((_, index) => index)
        }
        //连接两个结点
        union(p, q) {
            let rootP = this.find(p)
            let rootQ = this.find(q)
            if (rootP == rootQ) return
            this.parent[rootQ] = rootP
            this.count--

        }
        // 查找某个结点的根结点
        find(x) {
            if (this.parent[x] != x) {
                this.parent[x] = this.find(this.parent[x])
            }
            return this.parent[x]
        }
        // 判断两个结点是否连通
        isConnected(p, q) {
            let rootP = this.find(p)
            let rootQ = this.find(q)
            return rootP == rootQ

        }
        count() {
            return this.count
        }

    }

LeetCode684冗余连接

    const u = new UnionFind(edges.length + 1)
    for (let edge of edges) {
        const r1 = u.find(edge[0])
        const r2 = u.find(edge[1])
        if (r1 == r2) return edge
        u.union(r1, r2)
    }
    return []