Leetcode 208. Implement Trie (Prefix Tree)

这题其实就是一个单词查找树，具体什么原理原题的Solution里说的很清楚了。

找个答案是参考了《算法第四版》里单词查找树的实现。每个节点下面都有256个节点，在这里用了一个boolean变量判断某节点是否为单词的结尾，以区分search和startWith。

 

class Trie {
    private int R = 256;
    private Node root;
    /** Initialize your data structure here. */
    public Trie() {
        
    }
    
    /** Inserts a word into the trie. */
    public void insert(String word) {
        root = insert(root, word, 0);
    }
    
    /** Returns if the word is in the trie. */
    public boolean search(String word) {
        return search(root, word, 0);
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {
        return startsWith(root, prefix, 0);
    }
    
    private class Node {
        private boolean ifWord = false;
        private Node[] next = new Node[R];
    }
    
    private Node insert(Node x, String word, int d) {
        if(x == null) x = new Node();
        if(d == word.length()) { x.ifWord = true; return x;}
        char c = word.charAt(d);
        x.next[c] = insert(x.next[c], word, d+1);
        return x;
    }
    
    private Boolean startsWith(Node x, String word, int d) {
        if(x == null) return false;
        if(d == word.length()) return true;
        char c = word.charAt(d);
        return startsWith(x.next[c], word, d+1);
    }
    
    private Boolean search(Node x, String word, int d) {
        if(x == null) return false;
        if(d == word.length()) return x.ifWord;
        char c = word.charAt(d);
        return search(x.next[c], word, d+1);
    }
}

/**
 * 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);
 */