字符串的模式匹配算法——基于KMP算法的讨论

The Arithmetic of Matching the String's Mode ——Talking Over the KMP Arithmetic

重点对基本的串匹配算法和 KMP算法进行了探讨。通过对这两种算法的比较分析提出了一个新算法 ,此算法具有比基本的串匹配算法更优越的时间复杂性 。

The basic arithmetic of matching the string's mode and KMP arithmetic are discussed in this paper.The new arithmetic was put forward through the analysis for the two arithmetic.This arithmetic has some advantage of less time complexity and more simple than KMP arithmetic.