实现 Trie-前缀树(implement-trie-prefix-tree)

实现 Trie-前缀树(implement-trie-prefix-tree)

实现一个 Trie (前缀树)，包含 insert, search, 和 startsWith 这三个操作。

示例:

Trie trie = new Trie();

trie.insert("apple");
trie.search("apple");   // 返回 true
trie.search("app");     // 返回 false
trie.startsWith("app"); // 返回 true
trie.insert("app");   
trie.search("app");     // 返回 true

模板代码

class Trie {

    /** Initialize your data structure here. */
    public Trie() {

    }
    
    /** Inserts a word into the trie. */
    public void insert(String word) {

    }
    
    /** Returns if the word is in the trie. */
    public boolean search(String word) {

    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {

    }
}

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

代码

package implement_trie_prefix_tree;

class Trie {
	
    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 node = root;
        for (int i = 0; i < word.length(); i++) {
            char currentChar = word.charAt(i);
            if (!node.containsKey(currentChar)) {
                node.put(currentChar, new Node());
            }
            node = node.get(currentChar);
        }
        node.setEnd();    	 
    }
    
    /** Returns if the word is in the trie. */
    public boolean search(String word) {
        Node node = searchPrefix(word);
        return node != null && node.isEnd(); 
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {
        Node node = searchPrefix(prefix);
        return node != null;
    }
    
    // search a prefix or whole key in trie and
    // returns the node where search ends
    private Node searchPrefix(String word) {
        Node node = root;
        for (int i = 0; i < word.length(); i++) {
           char curLetter = word.charAt(i);
           if (node.containsKey(curLetter)) {
               node = node.get(curLetter);
           } else {
               return null;
           }
        }
        return node;
    }

	class Node {

	    // R links to node children
	    private Node[] nodes;

	    private final int R = 26;

	    private boolean isEnd;

	    public Node() {
	    	nodes = new Node[R];
	    }

	    public boolean containsKey(char ch) {
	        return nodes[ch -'a'] != null;
	    }
	    public Node get(char ch) {
	        return nodes[ch -'a'];
	    }
	    public void put(char ch, Node node) {
	    	nodes[ch -'a'] = node;
	    }
	    public void setEnd() {
	        isEnd = true;
	    }
	    public boolean isEnd() {
	        return isEnd;
	    }
	}
	
    public static void main(String[] args) {
    	Trie trie = new Trie();
    	trie.insert("apple");
    	trie.search("apple");   // 返回 true
    	trie.search("app");     // 返回 false
    	trie.startsWith("app"); // 返回 true
    	trie.insert("app");   
    	trie.search("app");     // 返回 true
    	System.out.println("param_2="+trie.startsWith("app"));
    	System.out.println("param_3="+trie.search("app"));
	}
}

参考资料

LeetCode题目
实现 Trie-前缀树(implement-trie-prefix-tree)视频