nyoj 5 Binary String Matching(kmp)
摘要：
Binary String Matching描述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 ... 阅读全文
posted @ 2015-10-27 18:20 焰 阅读(170) 评论(0) 推荐(0) 编辑