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 will select depends on Next table, when an iteration ends. The time complexity is O(n+m) THANKS Let s begin my topic is about kmp algorithm。 * But what is kmp algorithm, we should …. * subsequence * We should compare each element in long str with that in short str one by one, until there is a pair of elements that are not equal. * * * We know that, the traditional method will be cost much time, because each subsequence should be checked, when the length of long str is very long ,the efficiency will be very poor * * Each of the preceding subsequences corresponds to a index. * Each of the preceding subsequences corresponds to a index. * * List each preceding subsquence. For each case, we try to find the longest subsquence from back to front, which is equal but not same to that we find from front to back . Then the length of the longest subsquence will generate the next idex. * * KMP Algorithm Name：康炳杰 SIDStrat with a string matching problem Input: a long string and a short string (sequence). Object: To see if the long string contains the short one. Output: if it does, return true and the position in the long string; otherwise, return false. For example : long str : short str : Return : True and 9 Other example : long str : short str : Return : False How to solve this problem in program? Here is a simple example to simulate the process long