leetcode-208 Trie树

208. 实现 Trie (前缀树)
Trie（发音类似 "try"）或者说 前缀树 是一种树形数据结构，用于高效地存储和检索字符串数据集中的键。这一数据结构有相当多的应用情景，例如自动补完和拼写检查。

请你实现 Trie 类：

Trie() 初始化前缀树对象。
void insert(String word) 向前缀树中插入字符串 word 。
boolean search(String word) 如果字符串 word 在前缀树中，返回 true（即，在检索之前已经插入）；否则，返回 false 。
boolean startsWith(String prefix) 如果之前已经插入的字符串 word 的前缀之一为 prefix ，返回 true ；否则，返回 false 。
 

 class Trie {

        static class Node {
            String ch;            
            Map<String, Node> child = new HashMap<String, Node>();;
            int count = 0;
        }

        private final Node root;

        public Trie() {
            root = new Node();
        }
        
        public void insert(String word) {
            if (word == null || word.length() == 0) {
                return;
            }
            Node curr = root;
            for (int idx = 0; idx < word.length(); idx++) {
                String ch = word.substring(idx, idx + 1);
                Node child = curr.child.get(ch);
                if (child == null) {
                    child = new Node();
                    child.ch = ch;
                    curr.child.put(ch, child);
                } 
                if (idx == word.length() - 1) {
                    child.count++;
                }
                curr = child;
            }
        }
        
        public boolean search(String word) {
            if (word == null || word.length() == 0) {
                return false;
            }
            Node curr = root;
            for (int idx = 0; idx < word.length(); idx++) {
                String ch = word.substring(idx, idx + 1);
                Node child = curr.child.get(ch);
                if (child == null) {
                    System.out.println("canno find " + ch);
                    return false;
                }
                curr = child;
            }
            return curr.count > 0;
        }
        
        public boolean startsWith(String word) {
            if (word == null || word.length() == 0) {
                return false;
            }
            Node curr = root;
            for (int idx = 0; idx < word.length(); idx++) {
                String ch = word.substring(idx, idx + 1);
                Node child = curr.child.get(ch);
                if (child == null) {
                    return false;
                }
                curr = child;
            }
            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);
 */