char s[maxn];
char p[maxn];
int NEXT[maxn];
void getNext(){
int m = (int)strlen(s);
NEXT[0] = -1;
int k = -1;
for(int i=1; i<m; i++){
while(k != -1 && s[k+1] != s[i])
k = NEXT[k];
if(s[k+1] == s[i])
k++;
NEXT[i] = k;
}
}
int KMP(){
int k = -1;
int n = (int)strlen(s);
int m = (int)strlen(p);
for(int i=0; i<n; i++){
while(k != -1 && p[k+1] != s[i])
k = NEXT[k];
if(p[k+1] == s[i])
k = k+1;
if(k == m-1) return i-m+1;
}
return -1;
}
KMP再学习之模板
最新推荐文章于 2023-03-04 10:40:49 发布