Learning Summary of multi-pattern matching algorithm

The multi-pattern string matching algorithm mainly has the AC algorithm, is establishes a string automaton trie tree. It then establishes functions such as goto,failture and output.

The time complexity is O (n) and is related to the length of the string to be matched. Implementation: Constructs the prefix tree to set the failure function and each node to match the output to the target string

Search and jump. The failure function determines which state to fallback to. Build the Fail table based on the calculated fail value. Then it is the target string search. to a link:

Http://tech.meituan.com/ac.html. Single-mode matching is a traditional KMP and so on, BM algorithm. The next step is to combine the AC algorithm with the single-mode fast jump algorithm.

Learning Summary of multi-pattern matching algorithm