[LeetCode] 208. Implement Trie (Prefix Tree)

Problems: https://leetcode.com/problems/implement-trie-prefix-tree/

Solution:

class Trie {
	// TrieNode是Trie的基本元素
	// isTrie判断该字符是否是prefix结束
	// children记录字符的child
    class TrieNode {
        boolean isTrie;
        HashMap<Character, TrieNode> children = new HashMap<>();
    }
    // 全局变量head
    TrieNode head;
    
    // head为空
    /** Initialize your data structure here. */
    public Trie() {
        head = new TrieNode();
    }
    
    
    /** Inserts a word into the trie. */
    public void insert(String word) {
        char[] ch = word.toCharArray();
        TrieNode cur = head;
        for(char c : ch) {
        // 如果没有c，则插入c
            if(!cur.children.containsKey(c)) {
                cur.children.put(c, new TrieNode());
            }
            // 如果有c，则让cur指向c，之后的迭代就是增加cur的后缀
            cur = cur.children.get(c);
        }
        // 当遍历到单词末尾时，boolean值改为true
        cur.isTrie = true;
    }
    
    /** Returns if the word is in the trie. */
    public boolean search(String word) {
        char[] ch = word.toCharArray();
        TrieNode cur = head;
        for(char c: ch) {
            if(!cur.children.containsKey(c)) {
                return false;
            }
            cur = cur.children.get(c);
        }
        // 查找单词，最后一个字符的isTrie必为true
        return cur.isTrie == true;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {
        char[] ch = prefix.toCharArray();
        TrieNode cur = head;
        for(char c : ch) {
             if(!cur.children.containsKey(c)) {
                return false;
            }
            cur = cur.children.get(c);
        }
        // 检索prefix，最后一个字符的isTrie不一定要true，只要prefix的字符全部按顺序存在于trie中即可
        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);
 */