| 摘要 |
The present invention relates to the technical field of information processing, and particularly, to an algorithm for fast character string matching. In the present invention, a target character string is preprocessed first to obtain a simple hash table of each character of the target character string; and a last character of the target character string is matched after the first character is matched. The present invention can effectively improve matching effects, and avoid problems such as low efficiency caused by repeated matching, and the present invention can be applied in the fields of text editors, search engines and full-text retrieval systems and the like needing fast character string search. |
