int getNext(int a[], int next[], int n)
{
next[0] = -1;
int j = 0;
int k = -1;
while(j < n-1)
{
if(k == -1 || a[k] = a[j])
{
j++;
k++;
next[j] = k;
}
else
k = next[k];
}
}
void KMPMatch(char *src, char *des,int next[])
{
int next[100];
int i,j;
i = 0;
j = 0;
getNext(src,next);
while(i < strlen(src))
{
if(j == -1 || src[i] == des[j])
{
i++;
j++;
}
else
j = next[j];
if(j == strlen(des))
return i-strlen(des);
}
return -1;
}