南阳oj入门problem5二元字符串匹配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 a substring of B? For example, the text string B is ‘1001110110’ whi...
原创
2019-03-25 22:14:35 ·
134 阅读 ·
0 评论