Added test

Author: javadev

src/main/java/g3601_3700/s3608_minimum_time_for_k_connected_components/Solution.java

@@ -1,7 +1,7 @@
 package g3601_3700.s3608_minimum_time_for_k_connected_components;
 
 // #Medium #Sorting #Binary_Search #Graph #Union_Find
-// #2025_07_08_Time_34_ms_(99.83%)_Space_97.36_MB_(23.12%)
+// #2025_07_08_Time_29_ms_(100.00%)_Space_91.87_MB_(71.29%)
 
 public class Solution {
     public int minTime(int n, int[][] edges, int k) {
@@ -28,24 +28,16 @@ public int minTime(int n, int[][] edges, int k) {
 
     private int countComponents(int n, int[][] edges, int t) {
         int[] parent = new int[n];
-        int[] size = new int[n];
         for (int i = 0; i < n; i++) {
             parent[i] = i;
-            size[i] = 1;
         }
         int comps = n;
         for (int[] e : edges) {
             if (e[2] > t) {
                 int u = find(parent, e[0]);
                 int v = find(parent, e[1]);
                 if (u != v) {
-                    if (size[u] < size[v]) {
-                        int tmp = u;
-                        u = v;
-                        v = tmp;
-                    }
                     parent[v] = u;
-                    size[u] += size[v];
                     comps--;
                 }
             }

src/test/java/g3601_3700/s3608_minimum_time_for_k_connected_components/SolutionTest.java

@@ -20,4 +20,11 @@ void minTime2() {
     void minTime3() {
         assertThat(new Solution().minTime(3, new int[][] {{0, 2, 5}}, 2), equalTo(0));
     }
+
+    @Test
+    void minTime4() {
+        assertThat(
+                new Solution().minTime(3, new int[][] {{2, 1, 1469}, {1, 0, 5701}}, 2),
+                equalTo(1469));
+    }
 }