C++ (Cpp) WordDictionary Examples

Example #1

File: addAndSearchWord-DataStructureDesign.cpp Project: Sean-Lan/Armory

int main() {
    WordDictionary dict = WordDictionary();
    dict.addWord("a");
    cout << dict.search("a") << endl;
    cout << dict.search("b") << endl;
    return 0;
}

Example #2

File: main.cpp Project: 540485909/leetcode

// Your WordDictionary object will be instantiated and called as such:
// WordDictionary wordDictionary;
// wordDictionary.addWord("word");
// wordDictionary.search("pattern");
int main(){
	 WordDictionary wordDictionary;
	 wordDictionary.addWord("a");
	 wordDictionary.search("a");
	 cout<<wordDictionary.search("aa");
	 cout<< wordDictionary.search(".a");
}

Example #3

int main() {

    WordDictionary wordDictionary;
    wordDictionary.addWord("word");
    cout << wordDictionary.search("pattern") << endl;
    return 0;

}

Example #4

File: 211_add_and_search_word.cpp Project: guohuiGH/codes

int main () {
	WordDictionary wd;
	wd.addWord("bad");
	wd.addWord("cad");
	wd.addWord("adfad");
	cout << wd.search(".") << endl;
	//cout << wd.search(".") << wd.search(".") << endl;

}

Example #5

File: add_and_search_word.cpp Project: wuxuecheng/leetcode

int main()
{
    WordDictionary dict = WordDictionary();
    dict.addWord("apple");
    std::cout << dict.search("apple") << std::endl;   // returns true
    std::cout << dict.search("a..le") << std::endl;     // returns false
    std::cout << dict.search("a...") << std::endl;     // returns true
    return 0;
}

Example #6

File: AddAndSearchWord.cpp Project: lw9210/letcode

int main()
{
    WordDictionary wd;
    wd.addWord("a");
    cout << wd.search("a.") <<endl;;
    cout << wd.search(".a") << endl;;
    wd.addWord("bad");
    cout << wd.search("bad") <<endl;;
    cout << wd.search("b..") <<endl;;
    return 0;
}

Example #7

File: main.cpp Project: knightzf/review

int main() {
    //Solution s;
    WordDictionary d;
    d.addWord("bad");
    d.addWord("dad");
    d.addWord("mad");
    std::cout<<d.search("pad")<<std::endl;
    std::cout<<d.search("bad")<<std::endl;
    std::cout<<d.search(".ad")<<std::endl;
    std::cout<<d.search("b..")<<std::endl;
}

Example #8

File: 211.cpp Project: hilings/leetcode

int main(int arg, char *argv[]) {
    // insert code here...
    cout << "LeetCode 211. Add and Search Word - Data structure design, C++ ...\n\n";
    WordDictionary wordDictionary;
    
    wordDictionary.addWord("word");
    wordDictionary.addWord("ward");
    
    bool r = wordDictionary.search("word");
    cout << (r ? "true" : "false") << '\n';
    
    return 0;
}

Example #9

File: main.cpp Project: zhangruichang/Algorithm

int main()
{
/*
#ifndef ONLINE_JUDGE
    freopen ("in.txt" , "r" , stdin);
    freopen ("out.txt" , "w" , stdout);
#endif
*/
    WordDictionary wordDictionary;
    wordDictionary.addWord("word");
    //cout<<"zhang";
    cout<<wordDictionary.search("word");
	return 0;
}

Example #10

File: Add_and_Search_Word_Data_structure_design.cpp Project: brickgao/leetcode

// Your WordDictionary object will be instantiated and called as such:
int main() {
    WordDictionary wordDictionary;
    wordDictionary.addWord("word");
    wordDictionary.addWord("wxrd");
    wordDictionary.addWord("ssd");
    wordDictionary.addWord("sd");
    cout << boolalpha;
    cout << wordDictionary.search(".") << endl;
    cout << wordDictionary.search("woxxd") << endl;
    cout << wordDictionary.search("word") << endl;
    cout << wordDictionary.search("w.rd") << endl;
    cout << wordDictionary.search("wx.d") << endl;
    cout << wordDictionary.search("ss.") << endl;
    return 0;
}

Example #11

File: 211.Add and Search Word - Data structure design.cpp Project: whguo/LeetCode

int main()
{
	WordDictionary obj;
    obj.addWord("bad");
    obj.addWord("dad");
    obj.addWord("mad");
    cout<<obj.search("pad")<<endl;
    cout<<obj.search("bad")<<endl;
    cout<<obj.search(".ad")<<endl;
    cout<<obj.search("b..")<<endl;
    cout<<endl;
    obj.addWord("at");
    obj.addWord("and");
    obj.addWord("an");
    cout<<obj.search("a")<<endl;
}

Example #12

File: addSearchWord_unittest.cpp Project: teaspring/problems

/*
 * addSearchWord.cpp, class WordDictionary()
 * void insert(string word)
 * bool search(string word)
 * */
TEST(WordDictionaryTest, Positive01){
    WordDictionary *trie = new WordDictionary();
    trie->addWord(string("bad"));
    trie->addWord(string("dad"));
    trie->addWord(string("mad"));

    EXPECT_FALSE(trie->searchWord(string("pad")));
    EXPECT_TRUE(trie->searchWord(string("bad")));
    EXPECT_TRUE(trie->searchWord(string(".ad")));
    EXPECT_FALSE(trie->searchWord(string("b.")));
    EXPECT_TRUE(trie->searchWord(string("b..")));
    EXPECT_FALSE(trie->searchWord(string(".b.")));
    EXPECT_TRUE(trie->searchWord(string(".a.")));

    delete trie;
    trie = NULL;
}

Example #13

File: Add and Search Word - Data structure design.cpp Project: pkuzw/LeetCode-Zhao-Wei-

int main()
{
	bool rslt = false;
	WordDictionary* dict = new WordDictionary;
	dict->addWord("a");
 	dict->addWord("a");
	rslt = dict->search(".");
 	rslt = dict->search("a");
	rslt = dict->search("aa");
	rslt = dict->search("a");
	rslt = dict->search(".a");
	rslt = dict->search("a.");
	return 0;
}

Example #14

File: Add and Search Word - Data structure design .cpp Project: GaoLF/Leetcode

// Your WordDictionary object will be instantiated and called as such:
// WordDictionary wordDictionary;
// wordDictionary.addWord("word");
// wordDictionary.search("pattern");
int main()
{
	WordDictionary A;
	A.addWord("b");
	A.addWord("bad");
	A.addWord("dad");
	A.addWord("mad");
	cout<<A.search("pad")<<endl;
	cout<<A.search("bad")<<endl;
	cout<<A.search(".ad")<<endl;
	cout<<A.search("..d")<<endl;
	cout<<A.search("mad")<<endl;
	cout<<A.search("d")<<endl;
//	cout<<atoi("2147483648")<<endl;
	system("pause");
}

Example #15

File: leetcode_add_and_search_word.cpp Project: cbweixin/algorithm-practice

int main()
{
    WordDictionary wordDictionary;
    wordDictionary.addWord("at");
    wordDictionary.addWord("and");
    wordDictionary.addWord("an");
    wordDictionary.addWord("add");
    /* wordDictionary.search("a"); */
    /* wordDictionary.search("a."); */
    /* wordDictionary.search(".a"); */
    /* cout << wordDictionary.search(".at")<<endl; */
    wordDictionary.addWord("bat");
    cout << wordDictionary.search(".at")<<endl;
    /* wordDictionary.search(".b"); */
    /* wordDictionary.search("ab."); */
    /* wordDictionary.search("."); */
    /* wordDictionary.search(".."); */

    return 0;
}

Example #16

File: add_search_word.cpp Project: devastating/misc

void test_word_dict()
{
    WordDictionary dict;
	string str1("bad");
	string str2("dad");
	string str3("mad");

    dict.addWord(str1);
    dict.addWord(str2);
    dict.addWord(str3);
    cout << str1 << " insert in dict\n";
    cout << str2 << " insert in ditc\n";
    cout << str3 << " insert in dict\n";
    str1 = "pad";
    cout << str1 << " in dict? " << dict.search(str1) << endl;
    str1 = "bad";
    cout << str1 << " in dict? " << dict.search(str1) << endl;
    str1 = ".ad";
    cout << str1 << " in dict? " << dict.search(str1) << endl;
    str1 = "b..";
    cout << str1 << " in dict? " << dict.search(str1) << endl;
}

Example #17

File: 59.cpp Project: joeyuan19/ProjectEuler

int solve() {
    WordDictionary wd ("files/59_words.txt");
    vector<int> cipher;
    ifstream f;
    f.open("files/59.txt");
    string line, buf = "";
    int i;
    if (f.is_open()) {
        while (getline(f,line)) {
            buf = "";
            for (i = 0; i < line.size(); i++) {
                if (line.at(i) == ',' && buf.size() > 0) {
                    cipher.push_back(stoi(buf));
                    buf = "";
                } else {
                    buf += line.at(i);
                }
            }
            if (buf.size() > 0) {
                cipher.push_back(stoi(buf));
            }
        }
    }
    f.close();
    
    vector<string> words;
    int realWords = 0;
    double m = 0.0;
    string best = "", pass, tmp;
    char a,b,c;
    for (a = 'a'; a <= 'z'; a++) {
        for (b = 'a'; b <= 'z'; b++) {
            for (c = 'a'; c <= 'z'; c++) {
                pass = "";
                pass += a;
                pass += b;
                pass += c;
                tmp = decode(cipher,pass);
                words = getWords(tmp);
                realWords = 0;
                for (int i = 0; i < words.size(); i++) {
                    if (wd.find(words.at(i)) >= 0) {
                        realWords++;
                    }
                }
                if (((double)realWords)/words.size() > m) {
                    m = ((double)realWords)/words.size();
                    best = pass;
                }
            }
        }
    }
    cout << "Best: " << best << endl;
    tmp = decode(cipher,best);
    cout << "Decoded: " << tmp << endl;

    int s = 0;
    for (i = 0; i < tmp.size(); i++) {
        s += (int) tmp[i];
    }

    return s;
}

Example #18

File: 211_Add and Search Word - Data structure design.cpp Project: guan78001/hello

//addWord("bad")
//addWord("dad")
//addWord("mad")
//search("pad") -> false
//search("bad") -> true
//search(".ad") -> true
//search("b..") -> true
void test1() {
  WordDictionary wordDictionary;
  //wordDictionary.addWord("a");
  //wordDictionary.addWord("as");
  //wordDictionary.addWord("ass");
  //wordDictionary.addWord("bad");
  //wordDictionary.addWord("dad");
  //wordDictionary.addWord("mad");

  //assert(wordDictionary.search("a") == true);
  //assert(wordDictionary.search("as") == true);
  //assert(wordDictionary.search("ass") == true);
  //assert(wordDictionary.search("b") == true);

  //assert(wordDictionary.search("pad") == false);
  //assert(wordDictionary.search("bad") == true);
  //assert(wordDictionary.search(".ad") == true);
  //assert(wordDictionary.search("b..") == true);

  //addWord("at"), addWord("and"), addWord("an"), addWord("add"), search("a"), search(".at"), addWord("bat"),
  //search(".at"), search("an."), search("a.d."), search("b."), search("a.d"), search(".")
  //[false,false,true,true,false,false,true,false]

  wordDictionary.addWord("at");
  wordDictionary.addWord("and");
  wordDictionary.addWord("an");
  wordDictionary.addWord("add");

  assert(wordDictionary.search("a") == false);
  //printf("%d\n", wordDictionary.search(".at"));
  assert(wordDictionary.search(".at") == false);

  wordDictionary.addWord("bat");

  assert(wordDictionary.search(".at") == true);
  assert(wordDictionary.search("an.") == true);
  assert(wordDictionary.search("a.d.") == false);
  assert(wordDictionary.search("b.") == false);
  assert(wordDictionary.search("a.d") == true);

  assert(wordDictionary.search(".") == false);
}

Example #19

File: 211_Add and Search Word - Data structure design.cpp Project: guan78001/hello

void test3() {
  WordDictionary wd;
  wd.addWord("at");
  wd.addWord("and");
  wd.addWord("an");
  wd.addWord("add");

  assert(wd.search("a") == false);
  assert(wd.search("at") == true);
  wd.addWord("bat");

  assert(wd.search("an.") == true);
  assert(wd.search("a.d.") == false);
  assert(wd.search("b.") == false);
  assert(wd.search("a.d") == true);
  //assert(wd.search(".") == false);
}

Example #20

File: 211_Add and Search Word - Data structure design.cpp Project: guan78001/hello

void test2() {
//Input:
//	addWord("ran"), addWord("rune"), addWord("runner"), addWord("runs"), addWord("add"), addWord("adds"),
  //addWord("adder"), addWord("addee"), search("r.n"), search("ru.n.e"), search("add"), search("add."), search("adde."),
  //search(".an."), search("...s"), search("....e."), search("......."), search("..n.r")
//	Output :
//		   [false, false, true, true, true, false, true, true, false, false]
//Expected :
//	[true, false, true, true, true, false, true, true, false, false]
  WordDictionary wd;
  wd.addWord("ran");
  wd.addWord("rune");
  wd.addWord("runner");
  wd.addWord("runs");
  wd.addWord("add");
  wd.addWord("adds");
  wd.addWord("adder");
  wd.addWord("addee");

  //assert(wd.search("r.n") == true);
  //assert(wd.search("ru.n.e") == false);

  //assert(wd.search("add") == true);
  //assert(wd.search("add.") == true);
  //assert(wd.search(".an.") == true);
  assert(wd.search("adde.") == true);

  assert(wd.search("...s") == true);
  assert(wd.search("....e.") == true);
  assert(wd.search(".......") == false);
  assert(wd.search("..n.r") == false);
}