LeetCode - 208 实现Trie(前缀树)

class Trie {
    private Trie[] children ;//这个节点的子节点都有什么字符
    private boolean isEnd;//这个节点是不是结束字符

    public Trie() {
        children = new Trie[26];//节点的孩子节点
        isEnd = false;//该节点是不是结束字符
    }
    
    public void insert(String word){
        int len = word.length();//word的长度
        Trie node = this;//当前节点
        for(int i =0;i < len;i++){
            int index = word.charAt(i) - 'a';
            if(node.children[index] == null)
               node.children[index] = new Trie();
            node = node.children[index];
        }
        node.isEnd = true;
    }
    
    public boolean search(String word) {
        int len = word.length();
        Trie node = this;
        for(int i =0; i<len; i++){
            int index = word.charAt(i) - 'a';
            if(node.children[index] == null)
                return false;
            node = node.children[index];
        }
        if(node.isEnd == false)
           return false;
        else
           return true;
    }
    
    public boolean startsWith(String prefix) {
       int len = prefix.length();
        Trie node = this;
        for(int i =0; i<len; i++){
            int index = prefix.charAt(i) - 'a';
            if(node.children[index] == null)
                return false;
            node = node.children[index];
        }
        return true;
    }
}