Remove unnecessary imports and update README.

Author: yanglbme

solution/3300-3399/3378.Count Connected Components in LCM Graph/README.md

@@ -82,7 +82,7 @@ tags:
 
 <!-- solution:start -->
 
-### 方法一
+### 方法一：并查集
 
 <!-- tabs:start -->
 
@@ -135,8 +135,6 @@ class Solution:
 #### Java
 
 ```java
-import java.util.*;
-
 class DSU {
     private Map<Integer, Integer> parent;
     private Map<Integer, Integer> rank;
@@ -263,12 +261,6 @@ public:
 #### Go
 
 ```go
-package main
-
-import (
-	"fmt"
-)
-
 type DSU struct {
 	parent map[int]int
 	rank   map[int]int
@@ -329,7 +321,13 @@ func countComponents(nums []int, threshold int) int {
 }
 ```
 
-### Solution 2 (DFS)
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### 方法二：DFS
 
 <!-- tabs:start -->
 
@@ -368,8 +366,6 @@ class Solution:
 #### Java
 
 ```java
-import java.util.*;
-
 class Solution {
     private void dfs(int node, List<List<Integer>> adj, boolean[] visited) {
         if (visited[node]) return;
@@ -452,10 +448,6 @@ public:
 #### Go
 
 ```go
-package main
-
-import "fmt"
-
 func dfs(node int, adj [][]int, visited []bool) {
 	if visited[node] {
 		return

solution/3300-3399/3378.Count Connected Components in LCM Graph/README_EN.md

@@ -79,7 +79,7 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1 (DSU)
+### Solution 1: Union Find
 
 <!-- tabs:start -->
 
@@ -132,8 +132,6 @@ class Solution:
 #### Java
 
 ```java
-import java.util.*;
-
 class DSU {
     private Map<Integer, Integer> parent;
     private Map<Integer, Integer> rank;
@@ -260,12 +258,6 @@ public:
 #### Go
 
 ```go
-package main
-
-import (
-	"fmt"
-)
-
 type DSU struct {
 	parent map[int]int
 	rank   map[int]int
@@ -326,7 +318,13 @@ func countComponents(nums []int, threshold int) int {
 }
 ```
 
-### Solution 2 (DFS)
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### Solution 2: DFS
 
 <!-- tabs:start -->
 
@@ -365,8 +363,6 @@ class Solution:
 #### Java
 
 ```java
-import java.util.*;
-
 class Solution {
     private void dfs(int node, List<List<Integer>> adj, boolean[] visited) {
         if (visited[node]) return;
@@ -449,10 +445,6 @@ public:
 #### Go
 
 ```go
-package main
-
-import "fmt"
-
 func dfs(node int, adj [][]int, visited []bool) {
 	if visited[node] {
 		return

solution/3300-3399/3378.Count Connected Components in LCM Graph/Solution.go

@@ -1,9 +1,3 @@
-package main
-
-import (
-	"fmt"
-)
-
 type DSU struct {
 	parent map[int]int
 	rank   map[int]int

solution/3300-3399/3378.Count Connected Components in LCM Graph/Solution.java

@@ -1,5 +1,3 @@
-import java.util.*;
-
 class DSU {
     private Map<Integer, Integer> parent;
     private Map<Integer, Integer> rank;

solution/3300-3399/3378.Count Connected Components in LCM Graph/Solution2.go

@@ -1,7 +1,3 @@
-package main
-
-import "fmt"
-
 func dfs(node int, adj [][]int, visited []bool) {
 	if visited[node] {
 		return

solution/3300-3399/3378.Count Connected Components in LCM Graph/Solution2.java

@@ -1,5 +1,3 @@
-import java.util.*;
-
 class Solution {
     private void dfs(int node, List<List<Integer>> adj, boolean[] visited) {
         if (visited[node]) return;