[ Python ] KMP Algorithms

 def pmt(s):
     """
     :param s: the string to get its partial match table
     :return: partial match table
     """
     prefix = [s[:i + 1] for i in range(len(s) - 1)]
     suffix = [s[i + 1:] for i in range(len(s) - 1)]
     intersection = set(prefix) & set(suffix)
     if intersection:
         return len(max(intersection))
     else:
         return 0

 def kmp(source, target):
     for i in range(len(source)):
         pass