LeetCode 211. Add and Search Word - Data structure design

最新推荐文章于 2019-01-23 13:54:00 发布

原创最新推荐文章于 2019-01-23 13:54:00 发布 · 285 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解同时被 2 个专栏收录

288 篇文章

订阅专栏

Multiple Passes

85 篇文章

订阅专栏

本文介绍了一种Trie树的数据结构实现，并提供了添加单词和搜索包含通配符的单词的功能。通过C++代码示例详细展示了如何构建Trie树并进行高效查找。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <vector>
#include <string>
#include <iostream>
using namespace std;

/* This is a trie implemention */
class TrieNode {
public:
  bool isWord;
  vector<TrieNode*> child;
  TrieNode() : isWord(false) {child.assign(26, NULL);}
};

class Trie {
private:
  bool searchWord(string& word, TrieNode* p, int index) {
    if(p == NULL) return false;
    if(idx == word.size()) return p->isWord;
    if(word[index] == '.') {  // skip it!
        for(auto q : p->child) {
          if(searchWord(word, q, index+1)) return true;
        }
      return false;
    } else {
      return searchWord(word, p->child[word[index] - 'a'], index + 1);
    }
  }
public:
  Trie() {
    root = new TrieNode();
  }
  /* adds a word into the data structure. */
  void addWord(string word) {
    TrieNode* p = root;
    for(auto c : word) {
      int index = c - 'a';
      if(p->child[index] == NULL) {
        p->child[index] = new TrieNode();
      }
      p = p->child[index];
    }
    p->isWord = true;
  }

  /* 
    Returns if the word is in the data structure. A word cound
    contain the dot character '.' to represent any one letter.
  */
  bool search(string word) {
    return searchWord(word, root, 0);
  }
};