方法一:
#include<iostream>
#include<string.h>
#include<string.h>
#include <stdio.h>
#include <windows.h>
#include<iomanip>
using namespace std;
void get_next(char T[],int next[]){
int i,j,len;
next[0]=-1;
for(j=1;T[j]!='\0';j++)
{
for(len=j-1;len>=1;len--)
{
for(i=0;i<len;i++)
if(T[i]!=T[j-len+i]) break;
if(i==len)
{
next[j]=len;
break;
}
}
if(len<1) next[j]=0;
}
}
int KMP(char S[20],char T[20]){
int i=0,j=0;
int next[80];
get_next(T,next);
while(S[i]!='\0'&&T[j]!='\0'){
if(S[i]==T[j]){
i++;j++;
}else{
j=next[j];
if(j==-1){
i++;
j++;
}
}
}
if(T[j]=='\0'){
cout<<"在主串的第"<<i-strlen(T)+1<<"个位置匹配成功"<<endl;
}
else{
cout<<"匹配失败"<<endl;
}
return 0;
}
int main(){
char S[80],T[80];
cin>>S>>T;//注:S、T。S[80]、T[80]误
KMP(S,T);//正:int KMP(char S[20],char T[20]) KMP(&S、&T)误、int KMP(char &S[20],char &T[20])误 加*误
LARGE_INTEGER nFreq;
LARGE_INTEGER nBeginTime;
LARGE_INTEGER nEndTime;
double time;
QueryPerformanceFrequency(&nFreq);
QueryPerformanceCounter(&nBeginTime);
for (int i = 0; i < 1000; i++)
{
i++;
}
QueryPerformanceCounter(&nEndTime);
time=(double)(nEndTime.QuadPart-nBeginTime.QuadPart)*1000000000/(double)(nFreq.QuadPart);
cout<<"程序运行时间(单位是纳秒):"<<time<<endl;
return 0;
}
方法二:
#include<iostream>
#include<string.h>
#include<string.h>
#include <stdio.h>
#include <windows.h>
#include<iomanip>
using namespace std;
void get_next(char T[],int next[]){
int j=0;
int i=1;//i的初始值比j大,j前缀,i后缀。
next[0]=-1;
while(T[j]!='\0'){
if(j=0||T[i]==T[j]){//匹配
i++;
j++;
next[i]=j;//后缀的值的next值对应前缀末尾
}
else{//不匹配,回溯
j=next[j];//回到其对应前缀的最后一个字符
}
}
}
int KMP(char S[20],char T[20]){
int i=0,j=0;
int next[80];
get_next(T,next);
while(S[i]!='\0'&&T[j]!='\0'){
if(S[i]==T[j]){
i++;j++;
}else{
j=next[j];
if(j==-1){
i++;
j++;
}
}
}
if(T[j]=='\0'){
cout<<"在主串的第"<<i-strlen(T)+1<<"个位置匹配成功"<<endl;
}
else{
cout<<"匹配失败"<<endl;
}
return 0;
}
int main(){
char S[80],T[80];
cin>>S>>T;//注:S、T。S[80]、T[80]误
KMP(S,T);//正:int KMP(char S[20],char T[20]) KMP(&S、&T)误、int KMP(char &S[20],char &T[20])误 加*误
LARGE_INTEGER nFreq;
LARGE_INTEGER nBeginTime;
LARGE_INTEGER nEndTime;
double time;
QueryPerformanceFrequency(&nFreq);
QueryPerformanceCounter(&nBeginTime);
for (int i = 0; i < 1000; i++)
{
i++;
}
QueryPerformanceCounter(&nEndTime);
time=(double)(nEndTime.QuadPart-nBeginTime.QuadPart)*1000000000/(double)(nFreq.QuadPart);
cout<<"程序运行时间(单位是纳秒):"<<time<<endl;
return 0;
}