并查集(Union Find)

并查集(Union Find)

知乎上这篇文章写得挺好的，并查集详细介绍

朴素并查集模板

public class UnionFind {
		// int INF = 10000010;
        int[] p = new int[INF];
        int n;

        public void init(int n) { // n为可用结点总数，
            this.n = n;
            for (int i = 0; i < n; i ++) {
                p[i] = i;
            }
        }

        public int find(int x) {
            if (x != p[x]) p[x] = find(p[x]);
            return p[x];
        }

        public void union(int x, int y) {
            p[find(y)] = find(x);
            
        }

        public boolean isConnected(int x, int y) {
            return find(x) == find(y);
        }
    }

维护联通量大小的并查集模板

class UnionFind {
   int n;
   int[] p;
   int[] size;

   public void init(int n) {
       p = new int[n];
       size = new int[n];
       for (int i = 0; i < n; i ++) {
           p[i] = i;    
           size[i] = 1;
       }
   }

   public int find(int x) {
        if (x != p[x]) p[x] = find(p[x]);
        return p[x];
    }

    public void union(int x, int y) {
        size[find(x)] += size[find(y)];
        p[find(y)] = find(x);
    }
}

例题

LeetCode 130.被围绕的区域
LeetCode 128. 最长连续序列
LeetCode 684. 冗余连接 Redundant Connection(Java)
LeetCode 1856.子数组最小乘积的最大值