Runtime: 1782 ms (Top 87.91%) | Memory: 16.6 MB (Top 91.21%)

Author: AnasImloul

scripts/algorithms/M/Minimize Malware Spread/Minimize Malware Spread.py

@@ -1,3 +1,4 @@
+# Runtime: 1782 ms (Top 87.91%) | Memory: 16.6 MB (Top 91.21%)
 class Solution:
     def minMalwareSpread(self, graph: List[List[int]], initial: List[int]) -> int:
         n = len(graph)
@@ -6,9 +7,9 @@ def minMalwareSpread(self, graph: List[List[int]], initial: List[int]) -> int:
             for j in range(n):
                 if graph[i][j]:
                     uf.union(i, j)
-        
+
         max_remove = 0
-        
+
         initial.sort()
         min_index = initial[0]
         for i in range(len(initial)):
@@ -25,23 +26,20 @@ def minMalwareSpread(self, graph: List[List[int]], initial: List[int]) -> int:
                     min_index = initial[i]
 
         return min_index
-            
-        
-        
-        
+
 class UnionFind:
     def __init__(self, size):
         self.parent = {}
         self.rank = {}
         for i in range(size):
             self.parent[i] = i
             self.rank[i] = 1
-        
+
     def find(self, x):
         if x != self.parent[x]:
             x = self.find(self.parent[x])
         return x
-    
+
     def union(self, x, y):
         px, py = self.find(x), self.find(y)
         if px == py: return
@@ -50,4 +48,4 @@ def union(self, x, y):
             self.rank[px] += self.rank[py]
         else:
             self.parent[px] = py
-            self.rank[py] += self.rank[px]
+            self.rank[py] += self.rank[px]