剪花布條
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7036 Accepted Submission(s): 4678
#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = 1005;
char text[MAXN];
char pattern[MAXN];
int next[MAXN];
int n,m; char ch;
void get_next(){
next[0]=next[1]=0;
for(int i=1; i<m; i++){
int j=next[i];
while(j && pattern[i]!=pattern[j]) j=next[j];
next[i+1]=(pattern[i]==pattern[j]? j+1 : 0);
}
}
void kmp(){
int j=0,cnt=0;
for(int i=0; i<n; i++){
while(j && text[i]!=pattern[j]) j=next[j];
if(text[i]==pattern[j]) j++;
if(j==m){
cnt++; j=0; //j=0 可防止aaaaaa aa 輸出5
}
}
cout<<cnt<<endl;
}
int main()
{
while(true){
cin>>text;
n = strlen(text);
if(n==1 && text[0]=='#') break;
cin>>pattern;
m = strlen(pattern);
get_next();
kmp();
}
return 0;
}