Update palindrome-partitioning-iv.py

Author: kamyu104

Python/palindrome-partitioning-iv.py

@@ -10,21 +10,20 @@ def checkPartitioning(self, s):
         def modified_manacher(s):
             s = '^#' + '#'.join(s) + '#$'
             P = [0]*len(s)
-            dp1 = [False]*len(s)  # dp1[i]: s[:i] is a palindromic string
-            dp2 = [False]*len(s)  # dp2[i]: s[:i] is composed of 2 palindromic strings
+            dp = [0]*len(s)  # dp[i]: s[:i] is composed of dp[i] palindromic strings
             C, R = 0, 0
             for i in xrange(1, len(s)-1):
                 i_mirror = 2*C-i
                 if R > i:
                     P[i] = min(R-i, P[i_mirror])
                 while s[i+1+P[i]] == s[i-1-P[i]]:
-                    if dp1[i-1-P[i]]:
-                        dp2[(i+1+P[i])+1] = True
+                    if dp[i-1-P[i]]:
+                        dp[(i+1+P[i])+1] = dp[i-1-P[i]]+1
                     P[i] += 1
-                if i+1+P[i] == len(s)-1 and dp2[(i-1-P[i])+1]:
+                if i+1+P[i] == len(s)-1 and dp[(i-1-P[i])+1] == 2:
                     return True
                 if i-1-P[i] == 0:
-                    dp1[i+1+P[i]] = True
+                    dp[i+1+P[i]] = 1
                 if i+P[i] > R:
                     C, R = i, i+P[i]
             return False