208. Implement Trie (Prefix Tree)

public class Trie {

    class node{
        int count = 0;//  用来删除，计数删除,虽然没有删除
        node[] nodes = new node[26];
        boolean isEnd = false;
    }
    private node root;
    /** Initialize your data structure here. */
    public Trie() {
        root = new node();
    }

    /** Inserts a word into the trie. */
    public void insert(String word) {
        node head = root;
        for (int i = 0 ;i<word.length();i++){
            if (head.nodes[word.charAt(i)-'a']== null) {
                head.nodes[word.charAt(i) - 'a'] = new node();
            }    
                head = head.nodes[word.charAt(i) - 'a'];
                head.count++;
        }
        head.isEnd = true;
    }

    /** Returns if the word is in the trie. */
    public boolean search(String word) {
        node head = root;
        for (int i=0;i<word.length();i++){
            if (head.nodes[word.charAt(i)-'a']==null||head.nodes[word.charAt(i)-'a'].count==0){
                return false;
            }
            head = head.nodes[word.charAt(i)-'a'];
        }
        if (head.isEnd)return true;
        return false;
    }

    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {
        String word = prefix;
        node head = root;
        for (int i=0;i<word.length();i++){
            if (head.nodes[word.charAt(i)-'a']==null||head.nodes[word.charAt(i)-'a'].count==0){
                return false;
            }
            head = head.nodes[word.charAt(i)-'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);
 */