随笔分类 -  kmp&字典树

kmp&字典树 模板
摘要：kmp: const int maxn=1e5+5; char s[maxn],p[maxn]; int nex[maxn]; int KmpSearch(char* s, char* p) { int i = 0; int j = 0; int sLen = strlen(s); int pLen 阅读全文
posted @ 2020-07-27 22:17 JamZF 阅读(57) 评论(0) 推荐(0)