力扣： 按公因数计算最大组件大小

package com.算法专练.力扣.按公因数计算最大组件大小;

import java.util.Arrays;

/**
 * @author xnl
 * @Description:
 * @date: 2022/7/30   21:33
 */
public class Solution {
    public static void main(String[] args) {
        Solution solution = new Solution();

    }

    public int largestComponentSize(int[] nums) {
        int m = Arrays.stream(nums).max().getAsInt();
        Union union = new Union(m + 1);
        for (int num : nums){
            for (int i = 2; i * i <= num; i++){
                if (num % i == 0){
                    union.union(num, i);
                    union.union(num, num / i);
                }
            }
        }
        int[] counts = new int[m + 1];
        int ans = 0;
        for (int num : nums){
            int root = union.find(num);
            counts[root]++;
            ans = Math.max(ans, counts[root]);
        }
        return ans;

    }
}

class Union{
    int[] parent;
    int[] rank;

    public Union (int n){
        // 并查集初始化
        parent = new int[n];
        for (int i = 0; i < n; i++){
            parent[i] = i;
        }
        rank= new int[n];
    }

    // 按秩合并
    public void union(int x, int y){
        int rootx = find(x);
        int rooty = find(y);
        if (rootx != rooty){
            if (rank[rootx] > rank[rooty]){
                parent[rooty] = rootx;
            } else if (rank[rootx] < rank[rooty]){
                parent[rootx] = rooty;
            } else {
                parent[rooty] = rootx;
                rank[rootx] ++;
            }
        }
    }

    // 普通合并
    public void union2(int x, int y){
        parent[find(x)] = find(y);
    }

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