我在看KMP算法的时候,发现匹配算法和求next数组的索引都是从1开始求,但是我一般直接用字符数组时,索引都是从0开始,为避免浪费,所以改了改算法下面是求next数组算法
void get_nextfix(char* T, int* next) {
int j = -1;
int i = 0;
next[0] = -1;
int n = strlen(T);
while (i<n)
{
if (j == -1) {
i++;
j++;
next[i] = j;
}
else
{
while (T[i]==T[j])
{
i++;
j++;
next[i] = j;
}
j = next[j];
}
}
}
还有优化过后的代码
void get_nextvalfix(char* T, int* next) {
int j = -1;
int i = 0;
next[0] = -1;
int n = strlen(T);
while (i < n)
{
if (j == -1) {
i++;
j++;
if (T[i] == T[j]) next[i] = next[j];
else next[i] = j;
}
else
{
while (T[i] == T[j])
{
i++;
j++;
if (T[i] == T[j]) next[i] = next[j];
else next[i] = j;
}
j = next[j];
}
}
}