diff --git a/src/class09_15/Code04_LargestComponentSizebyCommonFactor.java b/src/class09_15/Code04_LargestComponentSizebyCommonFactor.java
deleted file mode 100644
index ffe66df..0000000
--- a/src/class09_15/Code04_LargestComponentSizebyCommonFactor.java
+++ /dev/null
@@ -1,104 +0,0 @@
-package class09_15;
-
-import java.util.HashMap;
-
-// 本题为leetcode原题
-// 测试链接：https://leetcode.com/problems/largest-component-size-by-common-factor/
-// 方法1会超时，但是方法2直接通过
-public class Code04_LargestComponentSizebyCommonFactor {
-
-	public static int largestComponentSize1(int[] arr) {
-		int N = arr.length;
-		UnionFind set = new UnionFind(N);
-		for (int i = 0; i < N; i++) {
-			for (int j = i + 1; j < N; j++) {
-				if (gcd(arr[i], arr[j]) != 1) {
-					set.union(i, j);
-				}
-			}
-		}
-		return set.maxSize();
-	}
-
-	public static int largestComponentSize2(int[] arr) {
-		int N = arr.length;
-		UnionFind unionFind = new UnionFind(N);
-		HashMap<Integer, Integer> fatorsMap = new HashMap<>();
-		for (int i = 0; i < N; i++) {
-			int num = arr[i];
-			int limit = (int) Math.sqrt(num);
-			for (int j = 1; j <= limit; j++) {
-				if (num % j == 0) {
-					if (j != 1) {
-						if (!fatorsMap.containsKey(j)) {
-							fatorsMap.put(j, i);
-						} else {
-							unionFind.union(fatorsMap.get(j), i);
-						}
-					}
-					int other = num / j;
-					if (other != 1) {
-						if (!fatorsMap.containsKey(other)) {
-							fatorsMap.put(other, i);
-						} else {
-							unionFind.union(fatorsMap.get(other), i);
-						}
-					}
-				}
-			}
-		}
-		return unionFind.maxSize();
-	}
-
-	public static int gcd(int m, int n) {
-		return n == 0 ? m : gcd(n, m % n);
-	}
-
-	public static class UnionFind {
-		private int[] parents;
-		private int[] sizes;
-		private int[] help;
-
-		public UnionFind(int N) {
-			parents = new int[N];
-			sizes = new int[N];
-			help = new int[N];
-			for (int i = 0; i < N; i++) {
-				parents[i] = i;
-				sizes[i] = 1;
-			}
-		}
-
-		public int maxSize() {
-			int ans = 0;
-			for (int size : sizes) {
-				ans = Math.max(ans, size);
-			}
-			return ans;
-		}
-
-		private int find(int i) {
-			int hi = 0;
-			while (i != parents[i]) {
-				help[hi++] = i;
-				i = parents[i];
-			}
-			for (hi--; hi >= 0; hi--) {
-				parents[help[hi]] = i;
-			}
-			return i;
-		}
-
-		public void union(int i, int j) {
-			int f1 = find(i);
-			int f2 = find(j);
-			if (f1 != f2) {
-				int big = sizes[f1] >= sizes[f2] ? f1 : f1;
-				int small = big == f1 ? f2 : f1;
-				parents[small] = big;
-				sizes[big] = sizes[f1] + sizes[f2];
-			}
-		}
-	}
-
-}