串的模式匹配算法,从下标0开始计算的。
void GetNext(char s[], int length, int next[])
{
int i = 0, j = -1;
next[0] = -1;
while(i < length)
{
if(-1 == j || s[i] == s[j])
{
i++;
j++;
next[i] = j;
}
else
j = next[j];
}
}
串的模式匹配算法,从下标0开始计算的。
void GetNext(char s[], int length, int next[])
{
int i = 0, j = -1;
next[0] = -1;
while(i < length)
{
if(-1 == j || s[i] == s[j])
{
i++;
j++;
next[i] = j;
}
else
j = next[j];
}
}