leetcode 208 前缀树

class Trie {
    //前缀树
    class Tree{
        Tree[] children;
        boolean isEnd; //判断当前节点是否是一个单词的结尾
        Tree(){
            children = new Tree[26];
        }
    }
    Tree root;
    public Trie() {
        root = new Tree();
    }
    
    public void insert(String word) {
        Tree node = root;
        for(int i=0 ; i<word.length() ; ++i){
            char c = word.charAt(i);
            if(node.children[c-'a'] == null){
                node.children[c-'a'] = new Tree();
            }
            node = node.children[c-'a'];
        }
        node.isEnd = true;
    }
    
    public boolean search(String word) {
        Tree node = root;
        for(int i=0 ; i<word.length() ; ++i){
            char c = word.charAt(i);
            if(node.children[c-'a'] == null){
                return false;
            }else{
                node = node.children[c-'a'];
            }
        }
        return node.isEnd;
    }
    
    public boolean startsWith(String prefix) {
        Tree node = root;
        for(int i=0 ; i<prefix.length() ; ++i){
            char c = prefix.charAt(i);
            if(node.children[c-'a'] == null){
                return false;
            }else{
                node = node.children[c-'a'];
            }
        }
        return true;
    }
}

/**
 * Your Trie object will be instantiated and called as such:
 * Trie obj = new Trie();
 * obj.insert(word);
 * boolean param_2 = obj.search(word);
 * boolean param_3 = obj.startsWith(prefix);
 */