archeryuan123的博客

原创 trie树，串排序，子串出现次数

package trie;public class Trie {private int size = 26; //26个字母private TrieNode root;Trie() {root = new TrieNode(); //树的跟节点}private class TrieNode { //节点类private int num; //通过该节点的字符串的数目private TrieNode