Implement Trie (Prefix Tree)

如何实现Trie字典。

当中有两点：

1. TrieNode中我们用的是大小为26的数组，而非map，因为题目本身限定，是字母的存储查询，用数组足够且更省空间。

2. boolean isExist，代表从root到此节点所构成的word，是否存在，记住，这个是可以不存在的，即便到其子节点可能存在。

class TrieNode {
    
    public char c;
    public TrieNode[] children = new TrieNode[26];
    public boolean isExist;
    // Initialize your data structure here.
    public TrieNode() {
    }
    public TrieNode(char c) {
        this.c = c;
    }
}

public class Trie {
    private TrieNode root;

    public Trie() {
        root = new TrieNode();
    }

    // Inserts a word into the trie.
    public void insert(String word) {
        if (word == null || word.length() == 0) {
            return;
        }
        TrieNode node = root;
        for (int i = 0; i < word.length(); i++) {
            int num = word.charAt(i) - 'a';
            if (node.children[num] == null) {
                TrieNode child = new TrieNode(word.charAt(i));
                node.children[num] = child;
                node = child;
            } else {
                node = node.children[num];
            }
        }
        node.isExist = true;
    }

    // Returns if the word is in the trie.
    public boolean search(String word) {
        if (word == null || word.length() == 0) {
            return false;
        }
        TrieNode node = root;
        for (int i = 0; i < word.length(); i++) {
            int num = word.charAt(i) - 'a';
            if (node.children[num] == null) {
                return false;
            } else {
                node = node.children[num];
            }
        }
        return node.isExist;
    }

    // Returns if there is any word in the trie
    // that starts with the given prefix.
    public boolean startsWith(String prefix) {
        if (prefix == null || prefix.length() == 0) {
            return false;
        }
        TrieNode node = root;
        for (int i = 0; i < prefix.length(); i++) {
            int num = prefix.charAt(i) - 'a';
            if (node.children[num] == null) {
                return false;
            } else {
                node = node.children[num];
            }
        }
        return true;
    }
}

// Your Trie object will be instantiated and called as such:
// Trie trie = new Trie();
// trie.insert("somestring");
// trie.search("key");