LeetCode 208. Implement Trie (Prefix Tree)

题目来源：https://leetcode.com/problems/implement-trie-prefix-tree/

问题描述

208. Implement Trie (Prefix Tree)

Medium

Implement a trie with insert, search, and startsWith methods.

Example:

Trie trie = new Trie();



trie.insert("apple");

trie.search("apple");   // returns true

trie.search("app");     // returns false

trie.startsWith("app"); // returns true

trie.insert("app");  

trie.search("app");     // returns true

Note:

• You may assume that all inputs are consist of lowercase letters a-z.
• All inputs are guaranteed to be non-empty strings.

------------------------------------------------------------

题意

实现字典树类，包含插入、查询、前缀查询方法

------------------------------------------------------------

思路

字典树模板题

字典树天然支持前缀查询功能，但是为了实现完整单词的查询，需要在字典树节点类中增加布尔值的isEnd字典，表示该字典树节点是否是某个单词的结尾

------------------------------------------------------------

代码

class Trie {
    class Node {
        boolean isEnd;  // if this node belongs to an end of a word
        Node[] next;    // 26 next pointer
        
        public Node() {
            next = new Node[26];
        }
    }
    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 ptr = root;
        for (char ch: word.toCharArray()) {
            int ind = ch - 'a';
            if (ptr.next[ind] == null) {
                ptr.next[ind] = new Node();
            }
            ptr = ptr.next[ind];
        }
        ptr.isEnd = true;
    }
    
    /** Returns if the word is in the trie. */
    public boolean search(String word) {
        Node ptr = root;
        for (char ch: word.toCharArray()) {
            int ind = ch - 'a';
            if (ptr.next[ind] == null) {
                return false;
            }
            ptr = ptr.next[ind];
        }
        return ptr.isEnd;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {
        Node ptr = root;
        for (char ch: prefix.toCharArray()) {
            int ind = ch - 'a';
            if (ptr.next[ind] == null) {
                return false;
            }
            ptr = ptr.next[ind];
        }
        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);
 */