随笔分类 -  KMP算法

KMP - 简单应用
摘要：#include#includechar s1[1000005],s2[1000005];int next[1000005];void get_next(char s[1000005]){ int i = 0; int len = strlen(s); next[0] = -1;... 阅读全文
posted @ 2014-08-14 15:19 HuberyQian 阅读(138) 评论(0) 推荐(0)
博客
摘要：http://www.cnblogs.com/Lyush/p/3415429.html 阅读全文
posted @ 2014-08-07 15:03 HuberyQian 阅读(80) 评论(0) 推荐(0)