![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
KMP
文章平均质量分 80
zichuan123456
这个作者很懒,什么都没留下…
展开
-
KMP比较简单的讲法。
转载链接:http://blog.csdn.net/yearn520/article/details/6729426 我们在一个母字符串中查找一个子字符串有很多方法。KMP是一种最常见的改进算法,它可以在匹配过程中失配的情况下,有效地多往后面跳几个字符,加快匹配速度。 当然我转载 2011-09-07 16:16:31 · 465 阅读 · 0 评论 -
Seek the Name, Seek the Fame(KMP)
链接:http://poj.org/problem?id=2752 Seek the Name, Seek the Fame Time Limit: 2000MS Memory Limit: 65536KB原创 2011-09-08 19:58:55 · 369 阅读 · 0 评论 -
Power Strings
链接 http://poj.org/problem?id=2406 Description Given two strings a and b we define a*b to be their concatenation. For example, if a =原创 2011-09-06 21:56:43 · 288 阅读 · 0 评论 -
Period
http://poj.org/problem?id=1961 Description For each prefix of a given string S with N characters (each character has an ASCII code原创 2011-09-09 10:44:17 · 578 阅读 · 0 评论 -
Oulipo
点击打开链接 Problem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: Tou原创 2012-02-04 20:21:03 · 593 阅读 · 0 评论