【KMP】剪花布条

 1 #include<iostream>
 2 #include<string.h>
 3 #include<stdio.h>
 4 using namespace std;
 5 char a[1005],b[1005];
 6 int Next[1005];
 7 
 8 void GetNext(int lb){
 9     int i=0,j=-1;
10     Next[0]=-1;
11     while(i<lb){
12         if(j==-1||b[i]==b[j]){
13             i++;j++;Next[i]=j;
14         }
15         else
16             j=Next[j];
17     }
18 }
19 
20 void KMP(int la,int lb){
21     int i=0,j=0,n=0;
22     while(i<la&&j<lb){
23         if(j==-1||a[i]==b[j]){
24             i++;j++;
25         }
26         else
27             j=Next[j];
28         if(j==lb){
29             n++;
30             j=0;    //注意j=0
31         }
32     }
33     cout<<n<<endl;
34 }
35 
36 int main()
37 {
38     int la,lb;
39     while(cin>>a&&a[0]!=‘#‘){
40         cin>>b;
41         la=strlen(a);
42         lb=strlen(b);
43         GetNext(lb);
44         KMP(la,lb);
45     }
46     return 0;
47 }