public class TrieNode {

    /** 形成一個鏈 */
    public TrieNode[] slot = new TrieNode[26];

    /** 字母 */
    public char c;

    /** 單詞：數(shù)量 > 0 表示一個單詞 */
    public boolean isWord;

    /** 前綴 */
    public int prefix;

    /** 單詞：具體的一個單詞字符串 */
    public String word;

    /** 解釋：單詞的注釋說明 */
    public String explain;

}

public void insert(String words, String explain) {
    TrieNode root = wordsTree;
    char[] chars = words.toCharArray();
    for (char c : chars) {
        int idx = c - 'a'; // - a 從 0 開始，參考 ASCII 碼表
        if (root.slot[idx] == null) {
            root.slot[idx] = new TrieNode();
        }
        root = root.slot[idx];
        root.c = c;
        root.prefix++;
    }
    root.explain = explain; // 單詞的注釋說明信息
    root.isWord = true;     // 循環(huán)拆解單詞后標記
}

public List<String> searchPrefix(String prefix) {
    TrieNode root = wordsTree;
    char[] chars = prefix.toCharArray();
    StringBuilder cache = new StringBuilder();
    // 精準匹配：根據(jù)前置精準查找
    for (char c : chars) {
        int idx = c - 'a';
        // 匹配為空
        if (idx > root.slot.length || idx < 0 || root.slot[idx] == null) {
            return Collections.emptyList();
        }
        cache.append(c);
        root = root.slot[idx];
    }
    // 模糊匹配：根據(jù)前綴的最后一個單詞，遞歸遍歷所有的單詞
    ArrayList<String> list = new ArrayList<>();
    if (root.prefix != 0) {
        for (int i = 0; i < root.slot.length; i++) {
            if (root.slot[i] != null) {
                char c = (char) (i + 'a');
                collect(root.slot[i], String.valueOf(cache) + c, list, 15);
                if (list.size() >= 15) {
                    return list;
                }
            }
        }
    }
    return list;
}

protected void collect(TrieNode trieNode, String pre, List<String> queue, int resultLimit){
    // 找到單詞
    if (trieNode.isWord) {
        trieNode.word = pre;
        // 保存檢索到的單詞到 queue
        queue.add(trieNode.word + " -> " + trieNode.explain);
        if (queue.size() >= resultLimit) {
            return;
        }
    }
    // 遞歸調(diào)用，查找單詞
    for (int i = 0; i < trieNode.slot.length; i++) {
        char c = (char) ('a' + i);
        if (trieNode.slot[i] != null) {
            collect(trieNode.slot[i], pre + c, queue, resultLimit);
        }
    }
}

@Test
public void test_trie() {
    Trie trie = new Trie();
    // 存入
    trie.insert("bat","大廠");
    trie.insert("batch", "批量");
    trie.insert("bitch", "彪子");
    trie.insert("battle", "戰(zhàn)斗");
    logger.info(trie.toString());
    // 檢索
    List<String> trieNodes = trie.searchPrefix("ba");
    logger.info("測試結(jié)果：{}", JSON.toJSONString(trieNodes));
}

06:21:38.226 [main] INFO trie.__test__.TrieTest - 測試結(jié)果：["bat -> 大廠","batch -> 批量","battle -> 戰(zhàn)斗"]

Process finished with exit code