search

hankcs / AhoCorasickDoubleArrayTrie

An extremely fast implementation of Aho Corasick algorithm based on Double Array Trie.
http://www.hankcs.com/program/algorithm/aho-corasick-double-array-trie.html
950 stars 290 forks source link

初始化前缀树的TreeMap的value如何取得,好像只有key能拿到? #19

Closed symsimmy closed 6 years ago

symsimmy commented 6 years ago

如题

hankcs commented 6 years ago

可以遍历的：

        for (int i = 0; i < acdat.size(); i++)
        {
            System.out.println(acdat.get(i));
        }
symsimmy commented 6 years ago

@hankcs 感谢解答