【Lintcode】442. Implement Trie (Prefix Tree)

题目地址：

https://www.lintcode.com/problem/implement-trie-prefix-tree/description

实现字典树Trie，题目保证所有字符串都由$a\sim z$组成。由于题目保证所有字符串都由$a\sim z$组成，所以对于Trie的Node类，它的next数组可以只开$26$的长度。代码如下：

public class Trie {
    
    class Node {
        boolean isWord;
        Node[] nexts;
        Node() {
            nexts = new Node[26];
        }
    }
    
    Node root;
    
    public Trie() {
        // do intialization if necessary
        root = new Node();
    }
    
    /*
     * @param word: a word
     * @return: nothing
     */
    public void insert(String word) {
        // write your code here
        Node cur = root;
        for (int i = 0; i < word.length(); i++) {
            char c = word.charAt(i);
            if (cur.nexts[c - 'a'] == null) {
                cur.nexts[c - 'a'] = new Node();
            }
            cur = cur.nexts[c - 'a'];
        }
        
        cur.isWord = true;
    }
    
    /*
     * @param word: A string
     * @return: if the word is in the trie.
     */
    public boolean search(String word) {
        // write your code here
        Node cur = root;
        for (int i = 0; i < word.length(); i++) {
            char c = word.charAt(i);
            if (cur.nexts[c - 'a'] == null) {
                return false;
            }
            cur = cur.nexts[c - 'a'];
        }
        
        return cur.isWord;
    }
    
    /*
     * @param prefix: A string
     * @return: if there is any word in the trie that starts with the given prefix.
     */
    public boolean startsWith(String prefix) {
        // write your code here
        Node cur = root;
        for (int i = 0; i < prefix.length(); i++) {
            char c = prefix.charAt(i);
            if (cur.nexts[c - 'a'] == null) {
                return false;
            }
            cur = cur.nexts[c - 'a'];
        }
    
        return true;
    }
}

时间复杂度$O(nl)$，$n$表示操作次数，$l$表示字符串最长长度。