Added test

Author: javadev

src/main/kotlin/g3601_3700/s3608_minimum_time_for_k_connected_components/Solution.kt

@@ -28,24 +28,16 @@ class Solution {
 
     private fun countComponents(n: Int, edges: Array<IntArray>, t: Int): Int {
         val parent = IntArray(n)
-        val size = IntArray(n)
         for (i in 0..<n) {
             parent[i] = i
-            size[i] = 1
         }
         var comps = n
         for (e in edges) {
             if (e[2] > t) {
-                var u = find(parent, e[0])
-                var v = find(parent, e[1])
+                val u = find(parent, e[0])
+                val v = find(parent, e[1])
                 if (u != v) {
-                    if (size[u] < size[v]) {
-                        val tmp = u
-                        u = v
-                        v = tmp
-                    }
                     parent[v] = u
-                    size[u] += size[v]
                     comps--
                 }
             }

src/test/kotlin/g3601_3700/s3608_minimum_time_for_k_connected_components/SolutionTest.kt

@@ -32,4 +32,12 @@ internal class SolutionTest {
             equalTo<Int>(0),
         )
     }
+
+    @Test
+    fun minTime4() {
+        assertThat(
+            Solution().minTime(3, arrayOf<IntArray>(intArrayOf(2, 1, 1469), intArrayOf(1, 0, 5701)), 2),
+            equalTo(1469),
+        )
+    }
 }