KMP模式匹配算法实现
void GetNext(string T, int next[])
{
int length = T.length();
int j = 0, k = -1;
next[0] = -1;
while ( j < length - 1 )
{
if ( -1 == k || T[j] == T[k] )
{
++j;
++k;
//if ( T[j] != T[k] )
//{
next[j] = k;
//}
//else
//{
原创
2020-05-18 11:16:42 ·
231 阅读 ·
1 评论