Update 3608-minimum-time-for-k-connected-components.js

Author: everthis

3608-minimum-time-for-k-connected-components.js

@@ -4,36 +4,38 @@
  * @param {number} k
  * @return {number}
  */
-var minTime = function (n, edges, k) {
-  let f = Array.from({ length: n }, (_, i) => i)
-
+var minTime = function(n, edges, k) {
   edges.sort((a, b) => b[2] - a[2])
-  let count = n
-  for (const [u, v, t] of edges) {
-    if (union(u, v)) {
-      count -= 1
-    }
-    if (count < k) {
-      return t
-    }
+  const uf = new UF(n)
+  let cnt = n
+  
+  for(let i = 0; i < edges.length; i++) {
+    const [u, v, t] = edges[i]
+    if(uf.union(u, v)) cnt--
+    if(cnt < k) return t
   }
   return 0
+};
 
-  function find(x) {
-    if (x === f[x]) {
-      return x
+class UF {
+  constructor(n) {
+    this.root = Array(n).fill(null).map((_, i) => i)
+  }
+  find(x) {
+    if (this.root[x] !== x) {
+      this.root[x] = this.find(this.root[x])
     }
-    f[x] = find(f[x])
-    return f[x]
+    return this.root[x]
   }
-
-  function union(x, y) {
-    x = find(x)
-    y = find(y)
-    if (x === y) {
+  union(x, y) {
+    const xr = this.find(x)
+    const yr = this.find(y)
+    if(xr === yr) {
       return false
+    } else {
+      this.root[yr] = xr
+      return true
     }
-    f[x] = y
-    return true
+
   }
 }