LeetCode211 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

Note:
You may assume that all words are consist of lowercase letters a-z.

思路：

这里我们用直接的存储输入然后检索的方式会在最后一个实例中超出运行时间；所以我们这里将输入按照长度进行存储，并且是放在一个set中。

class WordDictionary {
public:
	/** Initialize your data structure here. */
	WordDictionary() {
	}

	/** Adds a word into the data structure. */
	void addWord(string word) {
		int len = int(word.size());
		while (strVV.size() < len)
			strVV.push_back(set<string>());
		strVV[len - 1].insert(word);
	}

	/** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
	bool search(string word) {
		int len = int(word.size());
		if (len > strVV.size() || strVV[len - 1].empty()) return false;
		for (string v : strVV[len - 1]) {
			if(matched(v, word)) return true;
		}
		return false;
	}
private:
	vector<set<string>> strVV;  //store words by their length
	bool matched(string v, string word) {
		for (int i = 0; i<int(word.size()); i++) {
			if(word[i] == '.') continue;
			else if(word[i] != v[i]) return false;
		}
		return true;
	}
};

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