KMP算法过程分析演示PPT(英文版).pptVIP

Next Table: (this example) How to build? Next = short string = 2+1 1+1 0+1 0+1 List each preceding subsequence. For each case, we try to find the longest subsequence from back to front, which is equal but not same to that we find from front to back . Then the length of the longest subsequence will generate the next index. Another example: Next = short string = 0+1 0+1 1+1 1+1 2+1 3+1 KMP Algorithm : In long string: KMP don’t need to reset the index in long str ,when an iteration ends. It can keep going and never go back. In short string: which index KMP wi