void next_index(char *str, int next[]) {h
int i = 0, j = -1, str_length = strlen(str);
next[0] = -1;
while(i < str_length) {
if(j == -1 || str[i] == str[j] ) {
++i;
++j;
next[i] = j;
} else {
j = next[j];
}
}
}
KMP算法精髓之预算NEXT值
< KMP >
回复 (0)