Runtime: 1146 ms (Top 40.37%) | Memory: 16.2 MB (Top 99.65%)

Author: AnasImloul

scripts/algorithms/0-9/01 Matrix/01 Matrix.py

@@ -1,21 +1,21 @@
+# Runtime: 1146 ms (Top 40.37%) | Memory: 16.2 MB (Top 99.65%)
 class Solution:
     def updateMatrix(self, mat: List[List[int]]) -> List[List[int]]:
         rows = len(mat)
         cols = len(mat[0])
-        
+
         for i in range(rows):
             for j in range(cols):
                 if mat[i][j] != 0:
                     top = mat[i-1][j] if i>0 else float('inf')
                     left = mat[i][j-1] if j>0 else float('inf')
                     mat[i][j] = 1 + min(top, left)
-        
+
         for i in range(rows-1, -1, -1):
             for j in range(cols-1, -1, -1):
                 if mat[i][j] != 0:
                     right = mat[i][j+1] if j<cols-1 else float('inf')
                     bottom = mat[i+1][j] if i<rows-1 else float('inf')
                     mat[i][j] = min(min(right, bottom)+1, mat[i][j])
-                    
-        
-        return mat
+
+        return mat