KMP
xindoo
10年技术博主,博客专家,曾就职于阿里 小米,目前任贝壳资深工程师。拥有运维、搜索广告、后端业务相关工作经验,擅长Java、Lniux、Redis……
展开
-
hdoj 1711 KMP Number Sequence
Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] =原创 2013-02-06 21:29:28 · 1666 阅读 · 1 评论 -
poj 1961 Period(kmp最短循环节)
题目链接 DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. T原创 2013-04-06 14:57:31 · 2345 阅读 · 0 评论 -
light oj 1255 - Substring Frequency (KMP)
题目链接题意: 输入两个字符串,计算二串在一串中出现的次数。 裸裸的KMP,参考刘汝佳《算法竞赛入门经典训练指南》 P212 或数据结构。代码如下://light oj 1255 - Substring Frequency (KMP)//2013-05-13-19.12#include #include const int maxn = 10000原创 2013-05-13 19:10:50 · 1673 阅读 · 0 评论