KMP algorithm

xiaoxiao2021-03-06  20

Public String getNext (string c) {

INT i = 1;

int [] next = new int [C.Length ()];

NEXT [0] = 0;

INT j = 0;

While (i

{

IF (j == 0 || CHARACTER.TOSTRING (C.Charat (i-1)). Equals (CHARACTER.TOSTRING (C.Charat (J-1))))))))

{ i;

J;

NEXT [I-1] = j;

} // if

Else

J = Next [J-1];

} // while

String str2 = "";

For (int m = 0; m )

{

Str2 = str2 integer.tostring (Next [M]);

} // for

Return STR2;

}

转载请注明原文地址:https://www.9cbs.com/read-39407.html

New Post(0)