2015年9月7日
字符串匹配
摘要： 描述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... 阅读全文
posted @ 2015-09-07 15:28 陈洪波 阅读(140) 评论(0) 推荐(0) 编辑