寻找子串匹配的个数代码,Java代码库,德仔网

代码语言

代码分类

【Java】寻找子串匹配的个数

作者:Dezai.CN / 发布于2011/5/27/ 544

描述

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 B, length (B) <= 100. And it is guaranteed that B is always longer than A.

输出

For each case, output a single line consist a single integer, tells how many times do B appears as a substring of A.

样例输入

3
11
1001110110
101
110010010010001
1010
110100010101011

样例输出

3
0
3

<div><span style="color: rgb(0,0,255)">import</span><span style="color: rgb(0,0,0)"> java.util.Scanner;

</span><span style="color: rgb(0,0,255)">public</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">class</span><span style="color: rgb(0,0,0)"> Main05 {

 </span><span style="color: rgb(0,128,0)">/**</span><span style="color: rgb(0,128,0)">
 * </span><span style="color: rgb(128,128,128)">@param</span><span style="color: rgb(0,128,0)"> args
 </span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)">
 </span><span style="color: rgb(0,0,255)">public</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">static</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> main(String[] args) {
 </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)"> TODO Auto-generated method stub</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> Scanner scan </span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">new</span><span style="color: rgb(0,0,0)"> Scanner(System.in);
 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> n </span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)"> scan.nextInt(); </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">测试数据的组数</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">while</span><span style="color: rgb(0,0,0)">(n </span><span style="color: rgb(0,0,0)">!=</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,0)">0</span><span style="color: rgb(0,0,0)">)
 {
 String A </span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)"> scan.next();
 String B </span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)"> scan.next();
 String temp </span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,0)">""</span><span style="color: rgb(0,0,0)">;
 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> count </span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,0)">0</span><span style="color: rgb(0,0,0)">;
 </span><span style="color: rgb(0,0,255)">if</span><span style="color: rgb(0,0,0)">(A.length() </span><span style="color: rgb(0,0,0)">></span><span style="color: rgb(0,0,0)"> B.length())
 System.out.println(count);
 </span><span style="color: rgb(0,0,255)">else</span><span style="color: rgb(0,0,0)">
 {
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(</span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> i </span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,0)">0</span><span style="color: rgb(0,0,0)">;i </span><span style="color: rgb(0,0,0)"><=</span><span style="color: rgb(0,0,0)"> B.length()</span><span style="color: rgb(0,0,0)">-</span><span style="color: rgb(0,0,0)">A.length();i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">)
 {
 temp </span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)"> B.substring(i, i</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(0,0,0)">A.length());</span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">注意字符串截取时最后一个下标不包含</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">if</span><span style="color: rgb(0,0,0)">(temp.equals(A))
 count</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">;
 }
 System.out.println(count); 
 }
 n</span><span style="color: rgb(0,0,0)">--</span><span style="color: rgb(0,0,0)">;
 }
 }
}</span></div>

试试其它关键字

　子串匹配的　

同语言下

可能有用的

Dezai.CN贡献的其它代码(4037)