Runtime: 68 ms (Top 16.25%) | Memory: 14 MB (Top 13.50%)

Author: AnasImloul

scripts/algorithms/A/Alphabet Board Path/Alphabet Board Path.py

@@ -1,3 +1,4 @@
+# Runtime: 68 ms (Top 16.25%) | Memory: 14 MB (Top 13.50%)
 class Solution:
     def alphabetBoardPath(self, target: str) -> str:
         def shortestPath(r,c,tr,tc):
@@ -18,17 +19,17 @@ def shortestPath(r,c,tr,tc):
                 c += 1
             if tr == 5 and pr != tr: path = path + 'D'
             return path
-        
+
         table = ['abcde','fghij','klmno','pqrst','uvwxy','z']
         r,c = 0,0
         ans = ""
         for character in target:
             t_row = None
             for i,word in enumerate(table):
-                if character in word: 
+                if character in word:
                     t_row = i
                     break
             t_col = table[i].index(character)
             ans += shortestPath(r,c,t_row,t_col) + '!'
             r,c = t_row,t_col
-        return ans
+        return ans