![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
KMP
pupil_blue
这个作者很懒,什么都没留下…
展开
-
(KMP算法)HDOJ-----1711Number Sequence
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22067 Accepted Submission(s): 9434Problem DescriptionGiven two se原创 2016-08-16 20:31:42 · 248 阅读 · 0 评论 -
NYOJ-----5---Binary String Matching(KMP)
Binary String Matching时间限制:3000 ms | 内存限制:65535 KB难度:3描述 Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a subst原创 2016-12-22 15:42:12 · 226 阅读 · 0 评论