trie的原理是利用字符串集合中字符串的公共前缀来降低时间开销以达到提高效率的目的。

它具有以下性质:1,根结点不包含任何字符信息 2,如果字符的种数为n,则每个结点的出度为n(这样必然会导致浪费很多空间,这也是trie的缺点,我还没有想到好点的办法避免) 3,查找，插入复杂度为O(n),n为字符串长度。-The principle is the use of a string trie collection of string prefix to reduce the time overhead of public view to increasing efficiency. It has the following properties: 1, root node does not contain any character information　2, if the number of kinds of characters n, then each node of the out-degree of n (this will inevitably lead to waste a lot of space, this is also the shortcomings of trie , I have not thought a good way to avoid points)　3, find, insert the complexity is O (n), n for the length of the string.