代码都经过调试运行,平台为VS2010.
#include <iostream>
using namespace::std;
const int n=26,m=6;
void main()
{
char T[] = "JIM_SAW_ME_IN_A_BARBERSHOP";
int Table[] = {6,6,6,6,6,4,6,6,6,1,6,6,6,6,4,6,2,4,3,2,1,3,6,6,6,6};
char b[] = "BARBER";
int i = m-1;
while(i<=n-1)
{
int k=0;
while(k<=m-1&b[m-1-k]==T[i-k])
{
k++;
}
if(k==m)
{
cout<<i-m+1<<endl;;
i=n+1;
}
else
i=i+Table[i];
}
if(i==n)
cout<<"cannot find the m!"<<endl;
}