LeetCode#211 Add and Search Word - Data structure design Java解法（使用Trie树的结构）

题干

设计一个支持以下两种操作的数据结构：

void addWord(word)
bool search(word)

search(word) 可以搜索文字或正则表达式字符串，字符串只包含字母 . 或 a-z 。 . 可以表示任何一个字母。
示例:

addWord("bad")
addWord("dad")
addWord("mad")
search("pad") -> false
search("bad") -> true
search(".ad") -> true
search("b..") -> true

说明:
你可以假设所有单词都是由小写字母 a-z 组成的。

解法

创建Trie树，使用递归方式检索单词是否存在。

class WordDictionary {
    private class Node{
        public boolean isWord;
        public TreeMap<Character, Node> next;
        
        public Node(){
            isWord = false;
            next = new TreeMap<>();
        }
    }
    private Node root;
    
    /** Initialize your data structure here. */
    public WordDictionary() {
        root = new Node();
    }
    
    /** Adds a word into the data structure. */
    public void addWord(String word) {
        Node cur = root;
        for(int i = 0; i < word.length(); i++){
            char c = word.charAt(i);
            if(cur.next.get(c) == null)
                cur.next.put(c, new Node());
            cur = cur.next.get(c);
        }
        cur.isWord = true;
    }
    
    /** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
     public boolean search(String word) {
        return search(root,word,0);
    }

    private boolean search(Node node, String word, int index){
        if(index == word.length())
            return node.isWord;
        char c = word.charAt(index);
        if (c == '.') {
            for (char nextChar : node.next.keySet()) {
                if (search(node.next.get(nextChar), word, index + 1)) {
                    return true;
                }
            }
            return false;
        } else {
            if (node.next.get(c) == null) {
                return false;
            }
            return search(node.next.get(c), word, index + 1);
        }
    }
}

/**
 * Your WordDictionary object will be instantiated and called as such:
 * WordDictionary obj = new WordDictionary();
 * obj.addWord(word);
 * boolean param_2 = obj.search(word);
 */