例题
SDUT OJ 数据结构实验之串一:KMP应用
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 11234567;
int n,m;
int Next[N];
int a[N],b[N];
void get_next(int b[])
{
int i=0;
int j=-1;
Next[0] = -1;
while(i<n)
{
if(j==-1||b[i]==b[j])
{
i++;
j++;
if(b[i]==b[j])
Next[i] = Next[j];
else
Next[i] = j;
}
else
j = Next[j];
}
}
int KMP(int a[],int b[])
{
int i = 0;
int j = 0;
get_next(b);
while(i<n&&j<m)
{
if(j==-1||a[i]==b[j])
{
i++;
j++;
}
else
j = Next[j];
}
if(j==m)
return i+1-m;
else
return -1;
}
int main()
{
cin>>n;
for(int i=0; i<n; i++)
{
cin>>a[i];
}
cin>>m;
for(int i=0; i<m; i++)
{
cin>>b[i];
}
int t = KMP(a,b);
if(t!=-1)
{
if(KMP(a+t,b)==-1)
cout<<t<<' '<<t+m-1<<endl;
else
cout<<-1<<endl;
}
else
cout<<-1<<endl;
return 0;
}
模板1(求子串位置)
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 1000100;
char a[N],b[N];
int Next[N];
void get_next(char *str)
{
int i = 0;
int j = -1;
int len = strlen(str);
Next[0] = -1;
while(i<len)
{
if(j==-1||str[i]==str[j])
{
i++;
j++;
Next[i] = j;
}
else
j = Next[j];
}
}
int KMP(char *str1,char *str2)
{
int i=0;
int j=0;
int len1 = strlen(str1);
int len2 = strlen(str2);
get_next(str2);
while(i<len1&&j<len2)
{
if(j==-1||str1[i]==str2[j])
{
i++;
j++;
}
else
j = Next[j];
}
if(j==len2)
return i-len2+1;
else
return -1;
}
模板2(求子串出现的次数)
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
char str1[N],str2[N];
int Next[N];
void getNext(char *str2)
{
int i = 0;
int j = -1;
Next[0] = -1;
int len = strlen(str2);
while(i<len)
{
if(j==-1||str2[i]==str2[j])
{
i++;
j++;
if(str2[i]==str2[j])
Next[i] = Next[j];
else
Next[i] = j;
}
else
j = Next[j];
}
}
int KMP(char *str1,char *str2)
{
int ans = 0;
int i = 0;
int j = 0;
int len1 = strlen(str1);
int len2 = strlen(str2);
if(len1==1&&len2==1)
{
if(str1[0]==str2[0])
return 1;
else
return 0;
}
for(int i=0;i<len1;i++)
{
while(j>0 && str1[i]!=str2[j])
j = Next[j];
if(str2[j]==str1[i])
j++;
if(j==len2)
{
ans++;
j = Next[j];
}
}
return ans;
}
int main()
{
cin>>str1;
cin>>str2;
getNext(str2);
int count = KMP(str1,str2);
cout<<count<<endl;
return 0;
}