二进制子串问题

最新推荐文章于 2023-05-03 13:48:29 发布

Xsimpleton

最新推荐文章于 2023-05-03 13:48:29 发布

阅读量557

点赞数

分类专栏：南阳理工题库文章标签：子串边界问题

本文链接：https://blog.csdn.net/u010033175/article/details/8934268

版权

本文探讨了一个关于判断子串的问题，强调在处理边界时的注意事项。通过分析，指出在判断字符串A是否为B的子串时，可能会忽视尾部数据的边界问题。错误地使用len(B) - len(A)可能导致遗漏关键信息，正确的做法是明确考虑子串在B中的实际长度。

摘要由CSDN通过智能技术生成

描述

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 3, because the pattern A appeared at the posit

输入

The first line consist only one integer N, indicates N cases follows. In each case, there are two lines, the first line gives the string A, length (A) <= 10, and the second line gives the string