ac字符匹配算法--经典的多模式匹配算法，可以保证对于给定的长度为n的文本，和模式集合P{p1,p2,...pm}，在O(n)时间复杂度内，找到文本中的所有目标模式，而与模式集合的规模m无关-ac character matching algorithm- classic multi-pattern matching algorithm can ensure that the text of n for a given length, and the mode set P {p1, p2, ... PM in O (n) time complexity. to find all of the text in the target mode, regardless of the scale model ensemble m