字符串匹配的三种算法

KMP算法

#include<stdio.h>

#include<string.h>
#include<windows.h>
int main()
{
char s[1000]="sdgawegaerqdgdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddsadgoppopoewuusdfgweriiSDGDSGSDHGUIAYHERQEWOHUPASDFHISDHGIAOYDS7QW3RHUIDS45744686486A8SDFASDFQWEY9Q RTG6EWQEFWEGH7A8DSFQ78WETGQ6D5SR56aegfygaduysfgdasyfgsdygsadgfasweqrqoapfidsgsdfASDGAWRGQE;;'\\];a]p=='EAFadfasdgEWJsgdsdsdgsdgsd56564gGgdjkfghauisrhAPFHDSIYGUIAWEPRTG8943729843ASUYF7ATTAWEUHDUSGAOYHREUOEFASDGDFSGS";
char a[10]="aaaax";
int next[10]={-1};
int i=0,j=0,k=0;
for(i=1;a[i];i++)
{
if(a[0]==a[i])
{
j=i;
break;
}

}

i=0;
while(j!=0&&j<strlen(a))
{
if(a[i]==a[j]||i==-1)
{
i++;
j++;

if(a[i]!=a[j])
next[j]=i;
else
next[j]=next[i];

}
else
{
i=next[i];
}
}
for(i=0;a[i];i++)
{
printf("%d",next[i]);
}
j=0;
for(i=0;s[i];i++)
{
while(s[i]!=a[j])
{
j=next[j];
if(j==-1)
{
break;
}
}
j++;
k=j;
 if(k==strlen(a))
     {
      printf("Yes");
      return;
 }
}




if(k<strlen(a))
printf("No"); 



}

Brute Force算法

#include<stdio.h>
#include<string.h>
int main()
{
char s[1000]="sdgawegaerqdgdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddsadgoppopoewuusdfgweriiSDGDSGSDHGUIAYHERQEWOHUPASDFHISDHGIAOYDS7QW3RHUIDS45744686486A8SDFASDFQWEY9Q RTG6EWQEFWEGH7A8DSFQ78WETGQ6D5SR56aegfygaduysfgdasyfgsdygsadgfasweqrqoapfidsgsdfASDGAWRGQE;;'\\];a]p=='EAFadfasdgEWJsgdsdsdgsdgsd56564gGgdjkfghauisrhAPFHDSIYGUIAWEPRTG8943729843ASUYF7ATTAWEUHDUSGAOYHREUOEFASDGDFSGS";
char a[10]="SGS";
int i,j,k;
int ok=0;
puts(s);

for(i=0;s[i];i++)
{
j=0;
k=i;
while(j<strlen(a))
{

if(a[j]!=s[k])
  break;
k++;
j++;
}


if(j==strlen(a))
ok=1;

}
if(ok==1)
printf("yes");
else   
printf("no");
}

自创下表匹配法

#include<stdio.h>
#include<string.h>
int main()
{
char s[1000]="sdgawegaerqdgdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddsadgoppopoewuusdfgweriiSDGDSGSDHGUIAYHERQEWOHUPASDFHISDHGIAOYDS7QW3RHUIDS45744686486A8SDFASDFQWEY9Q RTG6EWQEFWEGH7A8DSFQ78WETGQ6D5SR56aegfygaduysfgdasyfgsdygsadgfasweqrqoapfidsgsdfASDGAWRGQE;;'\\];a]p=='EAFadfasdgEWJsgdsdsdgsdgsd56564gGgdjkfghauisrhAPFHDSIYGUIAWEPRTG8943729843ASUYF7ATTAWEUHDUSGAOYHREUOEFASDGDFSGS";
char a[10]="SGS";
int i,j=0,k=0;
int ok=0;
int m[100]={-1};
for(i=0;i<100;i++)
{
m[i]=-1;
} 
puts(s);

for(i=0;s[i];i++)
{
if(s[i]==a[0])
m[j++]=i;
}
for(i=m[k++];m[k-1]!=-1;i=m[k++])
{
j=1;
i++;
while(j<strlen(a))
{
if(s[i]!=a[j])
 break;
 i++;
 j++;
}
if(j==strlen(a))
 ok=1;
}
    if(ok)
    printf("Yes");
    else 
    printf("no");
    }