211. Add and Search Word - Data structure design

Design a data structure that supports the following two operations:

void addWord(word)
bool search(word)
search(word) can search a literal word or a regular expression string containing only letters a-z or … A . means it can represent any one letter.

Example:

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

利用字典树来做。搜索的时候使用dfs来搜索。

class WordDictionary {
    
    TrieNode root = new TrieNode();

    /** Initialize your data structure here. */
    public WordDictionary() {
        
    }
    
    /** Adds a word into the data structure. */
    public void addWord(String word) {
        TrieNode cur = root;
        for (int i = 0; i < word.length(); i++) {
            char c = word.charAt(i);
            if (cur._children[c - 'a'] == null) {
                cur._children[c - 'a'] = new TrieNode();
            }
            cur = cur._children[c - 'a'];
        }
        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 dfs(root, word, 0);
    }
    
    private boolean dfs(TrieNode node, String word, int index) {
        if (index == word.length()) {
            return node._isWord;
        }
        
        char c = word.charAt(index);
        if (c != '.') {
            if (node._children[c - 'a'] != null 
                && dfs(node._children[c - 'a'], word, index + 1)) {
                return true;
            } else {
                return false;
            }
        } else {
            for (TrieNode child : node._children) {
                if (child != null && dfs(child, word, index + 1)) {
                    return true;
                }
            }
            return false;
        }
    }
    
    private class TrieNode {
        TrieNode[] _children = new TrieNode[26];
        boolean _isWord;
    }
}