2021-01-08 java HashMap实现中文TireTree

java HashMap实现中文TireTree

直接上代码，粘贴就可以run

import java.util.HashMap;

/**
 * @ClassName DictTree
 * @Description TODO
 * @Author chendeyu
 * @Date 2021/1/8 14:38
 */
public class DictTree {

    class TrieNode {
        boolean flag;
        HashMap<Character, TrieNode> next = new HashMap<>();

        public TrieNode() {
            flag = false;
        }
    }

    TrieNode root;

    DictTree() {
        this.root = new TrieNode();
    }

    /**
     * Inserts a word into the trie.
     */
    public void insert(String word) {
        TrieNode node = root;
        for (Character c : word.toCharArray()) {
            if (!node.next.containsKey(c)) {
                TrieNode newNode = new TrieNode();
                node.next.put(c, newNode);
                node = newNode;
            } else {
                node = node.next.get(c);
            }
        }
        node.flag = true;
    }

    /**
     * Returns if the word is in the trie.
     */
    public boolean search(String word) {
        if (word.length() == 0) return true;
        TrieNode node = root;
        for (Character c : word.toCharArray()) {
            if (!node.next.containsKey(c)) return false;
            node = node.next.get(c);
        }
        return node.flag;
    }

    /**
     * Returns if there is any word in the trie that starts with the given prefix.
     */
    public boolean startsWith(String prefix) {
        if (prefix.length() == 0) return true;
        TrieNode node = root;
        for (Character c : prefix.toCharArray()) {
            if (!node.next.containsKey(c)) return false;
            node = node.next.get(c);
        }
        return true;
    }

    public static void main(String[] args) {
        final DictTree dictTree = new DictTree();
        dictTree.insert("大江大河");
        dictTree.insert("大江南北");
        System.out.println(dictTree.startsWith("大"));

    }

}