kmp
HJ_彼岸
这个作者很懒,什么都没留下…
展开
-
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原创 2014-07-19 12:17:33 · 2163 阅读 · 0 评论 -
hdu oj Period (kmp的应用)
Period Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2866 Accepted Submission(s): 1433 Problem Description For each prefix of原创 2014-07-23 15:11:00 · 1756 阅读 · 0 评论