剑指offer 专项突破版 62、实现前缀树

题目链接

思路

• 这个题目就学习一下前缀树的结点的定义方式就好啦~ 因为说了默认只存储小写字母，所以可以用一个长度为26的数组来存储子节点
• insert函数注意最后要把isWord置为true
• search函数注意只有最后isWord是true才能返回true
• startsWith则没有上述要求~

class Trie {
    private class TrieNode {
        TrieNode[] children;
        boolean isWord;

        TrieNode() {
            children = new TrieNode[26];
        }
    }

    private TrieNode root;

    /**
     * Initialize your data structure here.
     */
    public Trie() {
        root = new TrieNode();
    }

    /**
     * Inserts a word into the trie.
     */
    public void insert(String word) {
        TrieNode cur = root;
        for (char ch : word.toCharArray()) {
            if (null == cur.children[ch - 'a'])
                cur.children[ch - 'a'] = new TrieNode();

            cur = cur.children[ch - 'a'];
        }
        cur.isWord = true;
    }

    /**
     * Returns if the word is in the trie.
     */
    public boolean search(String word) {
        TrieNode cur = root;
        for (char ch : word.toCharArray()) {
            if (null == cur.children[ch - 'a'])
                return false;
            cur = cur.children[ch - 'a'];
        }
        return cur.isWord;
    }

    /**
     * Returns if there is any word in the trie that starts with the given prefix.
     */
    public boolean startsWith(String prefix) {
        TrieNode cur = root;
        for (char ch : prefix.toCharArray()) {
            if (null == cur.children[ch - 'a'])
                return false;
            cur = cur.children[ch - 'a'];
        }
        return true;
    }

}