[leetCode]839. 相似字符串组

题目

https://leetcode-cn.com/problems/similar-string-groups/

并查集

由题目可知，只要两个字符串相似则它们属于同一个连通分量，可以通过并查集维护连通分量的个数，最后返回。

class Solution {
    public int numSimilarGroups(String[] strs) {
        int n = strs.length;
        UnionFind uf = new UnionFind(n);
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                String str1 = strs[i];
                String str2 = strs[j];
                if (isSimilar(str1, str2, str1.length())) {
                    uf.union(i, j);
                }
            }
        }
        return uf.getCount();
    }

    class UnionFind {
        private int[] parent;
        private int count;

        public UnionFind(int n) {
            parent = new int[n];
            count = n;
            for (int i = 0; i < n; i++) {
                parent[i] = i;
            }
        }

        public int find(int x) {
            while (x != parent[x]) {
                parent[x] = parent[parent[x]];
                x = parent[x];
            }
            return x;
        }

        public boolean union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);
            if (rootX == rootY) {
                return false;
            }
            parent[rootX] = rootY;
            count--;
            return true;
        }

        public int getCount() { return count; }
    }

    private boolean isSimilar(String str1, String str2, int len) {
        int num = 0;
        for (int i = 0; i < len; i++) {
            if (str1.charAt(i) != str2.charAt(i)) {
                num++;
            }
        }
        return num <= 2;
    }

}