LeetCode -1627 带阈值的图连通性

class Solution {
    int[] copy;
    public List<Boolean> areConnected(int n, int threshold, int[][] queries) {
          UnionFind uf = new UnionFind(n+1);
          for (int num = 1; num<= n ;num++) {
            double upBound = Math.sqrt(num);
            for (int i = 1; i <= upBound; i++) {
                if (num % i == 0 ) {
                    if(i > threshold)
                      uf.union(num, i);
                    if((num / i) > threshold)
                      uf.union(num, num / i);
                }
            }
          }
          List<Boolean> list = new ArrayList<>();
          for(int i =0;i<queries.length;i++){
             if(uf.find(queries[i][0]) == uf.find(queries[i][1]))
                list.add(true);
             else
               list.add(false);
          }
          return list;
    }
     public class UnionFind{
        int[] parent;
        int[] rank;
        int[] size;
        public UnionFind(int n){
            parent = new int[n];
            rank = new int[n];
            size = new int[n];
            for(int i = 0;i < n;i++){
                parent[i] = i;
                rank[i] = 1;
                size[i] = 1;
            }

        }
        public int find(int x){
            if(parent[x] != x){
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }
         public void union(int x,int y){
            int rootX = find(x);
            int rootY = find(y);
            if(rootX == rootY)
               return ;
            parent[rootX] = rootY;
            size[rootY] += size[rootX];
        }
    }
}