KMP算法
#include<iostream>
#include <string>
using namespace std;
const int maxn = 1010;
int next[maxn];
int KMP(string ss,string p)
{
int i,j;
i = j = 0;
while(i < ss.length() && j < p.length()){
if(ss[i] == p[j]){
++i;
++j;
}
else{
//匹配不相等并且模式串已经到达开头的情况,
//没有可比较的公共前缀,主串++ 跳过这个字符
if(j == 0){
i++;
}
else{
j = next[j-1];
}
}
}
if(j == p.length())
return i - p.length();
else//i>=ss.length()//主串已经超出范围
return -1;
}
//求解next数组实际上是:对模式串当前字符之前的子串的公共前后缀最大长度的求得
void get_next(string p)
{
cout<<p<<endl;
int len = p.length();
int index = 0;//j
for(int i = 1 ; i < len ; ){
if(p[i] == p[index]){
//模式串相等时,i,j均向前移动,并且把j下标+1赋值给next[i]
next[i] = ++index;
++i;
}
else{
if(index != 0){
index = next[index-1];
}
else{
//j为零的时候,也就是j指向模式串头,不匹配i++,并且next[i] = 0
next[i] = 0;
++i;
}
}
}
}
int main()
{
string ss,pattern;
cin >> ss >> pattern;
get_next(pattern);
int len = pattern.length();
for(int i=0;i<len;i++){
cout<<next[i]<<" ";
}
cout<<endl;
int find = KMP(ss,pattern);
if(find == -1)
cout<<"Not Find!"<<endl;
else
cout<<"Find in "<<find<<" space."<<endl;
return 0;
}