String processing: KMP Algorithm

When I encountered a KMP algorithm during VJ refreshing, I learned it.

I read a clear explanation from a great god and understood it a little.

After reading it, You can clearly understand the simulation process of void KMP, that is, the movement of the J pointer.

But how to implement the J pointer movement is actually the core of the KMP algorithm.

The difference between the KMP algorithm and the plain algorithm is that the prefix function getnext

It is a bit similar to the familiar neighboring table, hash pointer operations, and so on. It uses prefix information.

If you do not understand it, manually simulate it again.

 

In fact, I am not very familiar with prefix arrays. I hope I can have a more thorough understanding of these questions.

And I think this algorithm is a simulated algorithm...

String processing: KMP Algorithm