[POJ 2752]Seek the Name, Seek the Fame[kmp]

最新推荐文章于 2022-04-04 20:50:21 发布

真·skysys

最新推荐文章于 2022-04-04 20:50:21 发布

阅读量554

点赞数 1

CC 4.0 BY-SA版权

分类专栏：算法与数学文章标签： kmp poj

请明确标注出处

本文链接：https://blog.youkuaiyun.com/qq_33583069/article/details/51933319

算法与数学专栏收录该内容

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

这是一个利用KMP算法解决寻找字符串中既是前缀又是后缀的子串长度的问题。输入包含多个测试用例，每个用例给出一个字符串，要求输出所有符合条件的子串长度，从小到大排列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

了解本专栏