摘要: 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 substring of B? For example, the text string B is ‘1001110110’ while the pattern string A is ‘11’, you should output 阅读全文
posted @ 2013-08-22 17:49 王莜轩 阅读(175) 评论(0) 推荐(0) 编辑