KMP
JamesLi6
编程虽然很繁琐、乏味。但我会一直坚持下去,让大学的生活更充实一些。
展开
-
KMP讲解
两种方法实现KMP算法(必懂KMP)六之再续:KMP算法之总结篇(必懂KMP)作者:July。出处:http://blog.csdn.net/v_JULY_v/。转载牛人的博客。引记 此前一天,一位MS的朋友邀我一起去与他讨论快速排序,红黑树,字典树,B树、后缀树,包括KMP算法,唯独在讲解KMP算法转载 2015-08-07 16:09:02 · 540 阅读 · 0 评论 -
poj 2406 Power Strings
Problem DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exp原创 2015-08-07 18:00:22 · 461 阅读 · 0 评论 -
KMP算法模板
/** * 由于KMP算法只预处理sub串,因此这种算法很适合这样的问题:给定一个sub串和一群不同的main串, * 问sub是哪些main串的子串。 *//* kmp & cal_next,将不使用数字的索引0,从1开始使用 */void kmp(char str_main[], int str_main_len, char str_sub[], int str_sub_len, i转载 2015-08-13 17:24:41 · 392 阅读 · 0 评论 -
hdoj 1686 Oulipo
Problem DescriptionThe 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:Tout avait Pa原创 2015-08-07 11:17:51 · 461 阅读 · 0 评论