Problem Description
The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such boring job, the innovative little cat works out an easy but fantastic algorithm:
Step1. Connect the father's name and the mother's name, to a new string S.
Step2. Find a proper prefix-suffix string of S (which is not only the prefix, but also the suffix of S).
Example: Father='ala', Mother='la', we have S = 'ala'+'la' = 'alala'. Potential prefix-suffix strings of S are {'a', 'ala', 'alala'}. Given the string S, could you help the little cat to write a program to calculate the length of possible prefix-suffix strings of S? (He might thank you by giving your baby a name:)
POJ2752 Seek the Name, Seek the Fame KMP(KMP中对next数组原理的理解)
最新推荐文章于 2023-05-22 16:06:45 发布
这篇博客介绍了如何使用KMP算法来寻找一个由父母名字连接成的字符串的前缀后缀,并给出了限制条件和样例输入输出。通过理解KMP算法中的next数组,可以找到所有可能的前缀后缀长度。
摘要由CSDN通过智能技术生成