Runtime: 878 ms (Top 47.91%) | Memory: 16.1 MB (Top 47.44%)

Author: AnasImloul

scripts/algorithms/S/Strange Printer/Strange Printer.py

@@ -1,3 +1,4 @@
+# Runtime: 878 ms (Top 47.91%) | Memory: 16.1 MB (Top 47.44%)
 class Solution(object):
     def strangePrinter(self, s):
         """
@@ -19,22 +20,21 @@ def _dp(i, j, background):
                 return 1 if background != s[i] else 0
             elif (i, j, background) in _m:
                 return _m[(i, j, background)]
-            
+
             ans = len(s)
-            
+
             # shrink s[i:j+1] to s[i_:j_+1] according to the background letter
             i_ = i + 1 if s[i] == background else i
             j_ = j - 1 if s[j] == background else j
-            
-            
+
             if s[i_] == s[j_]:
-                #  case "AxxxA" => best strategy is printing A first
+                # case "AxxxA" => best strategy is printing A first
                 ans = _dp(i_ + 1, j_ - 1, s[i_]) + 1
             else:
-                # otherwise, print first letter, try every possible print length 
+                # otherwise, print first letter, try every possible print length
                 for p in range(i_, j_ + 1):
                     # searching is needed only if s[p] == s[i_]
-                    # e.g. s="ABCDEA"，print 'A' on s[0:1] is equivalent to s[0:5]
+                    # e.g. s="ABCDEA"print 'A' on s[0:1] is equivalent to s[0:5]
                     if s[p] != s[i_]:
                         continue
                     l = _dp(i_, p, s[i_])
@@ -43,4 +43,4 @@ def _dp(i, j, background):
             _m[(i, j, background)] = ans
             return ans
 
-        return _dp(0, len(s) - 1, '')
+        return _dp(0, len(s) - 1, '')