KMP算法模板
2014-08-08 21:21
267 查看
//=======KMP==============//
int KMP(char *t, int pos)
{
int i, j;
i = pos;
j = 0;
while(s[i]!=0 && j<length)
{
if(j == -1 || t[j] == s[i])
{
i++;
j++:
}
else
j = next[j];
}
if(j == length)
return i-j;
else
return -1;
}
int KMP(char *t, int pos)
{
int i, j;
i = pos;
j = 0;
while(s[i]!=0 && j<length)
{
if(j == -1 || t[j] == s[i])
{
i++;
j++:
}
else
j = next[j];
}
if(j == length)
return i-j;
else
return -1;
}