leetcode211

#include <iostream>
#include<stdlib.h>
#include<string>
#include<vector>
typedef  long long  ll;
using namespace std;
vector<string> wordlist;
vector<vector<string>>ans;//所有答案
vector<string>path;
bool cmp(string left, string right) {
	return left.length() < right.length() ? true : false;
}
void addWord(string newword) {
	wordlist.push_back(newword);
	sort(wordlist.begin(), wordlist.end(), cmp);
}
//用此函数之前已经保证两个单词长度一致
bool isEqual(string str, string pattern) {
	for (int i = 0; i < str.length(); i++) {
		if (str[i] != pattern[i] && pattern[i] != '.')
			return false;
	}
	return true;
}
//current表示当前最后一个字符的位置
bool search(string pattern) {
	for (int i = 0; i<wordlist.size() && wordlist[i].length() <= pattern.length(); i++){
		if (wordlist[i].length() == pattern.length() && isEqual(wordlist[i], pattern)) {
			cout <<pattern << ":   true" << endl;
			return true;
		}			
	}
	cout << pattern << ":   false" << endl;
	return false;
}
int main() {
	addWord("zlz");
	addWord("hy");
	addWord("lmm");
	search("zzz");
	search("hy");
	
	system("pause");
	return 0;
}