标签:style blog ar color os sp java for on
描述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
3
11
1001110110
101
110010010010001
1010
110100010101011
3 0 3
1 import java.util.Scanner; 2 3 public class Main { 4 public static void main(String[] args) { 5 Scanner scanner=new Scanner(System.in); 6 int T; 7 String A; 8 String B; 9 int startPoint; 10 int count; 11 12 T=scanner.nextInt(); 13 while(T!=0){ 14 T--; 15 startPoint=0; 16 count=0; 17 18 A=scanner.next(); 19 B=scanner.next(); 20 21 while(true){ 22 startPoint=B.indexOf(A,startPoint); 23 24 if(startPoint==-1) 25 break; 26 27 count++; 28 startPoint++; 29 } 30 31 System.out.println(count); 32 } 33 } 34 }
标签:style blog ar color os sp java for on
原文地址:http://www.cnblogs.com/zqxLonely/p/4129540.html