feat: add go,cpp solutions to lc problem: No.0211

No.0211.Design Add and Search Words Data Structure

Author: maolonglong

solution/0200-0299/0211.Design Add and Search Words Data Structure/README.md

@@ -177,6 +177,144 @@ class WordDictionary {
  */
 ```
 
+### **Go**
+
+```go
+type WordDictionary struct {
+	root *trie
+}
+
+func Constructor() WordDictionary {
+	return WordDictionary{new(trie)}
+}
+
+func (this *WordDictionary) AddWord(word string) {
+	this.root.insert(word)
+}
+
+func (this *WordDictionary) Search(word string) bool {
+	n := len(word)
+
+	var dfs func(int, *trie) bool
+	dfs = func(i int, cur *trie) bool {
+		if i == n {
+			return cur.isEnd
+		}
+		c := word[i]
+		if c != '.' {
+			child := cur.children[c-'a']
+			if child != nil && dfs(i+1, child) {
+				return true
+			}
+		} else {
+			for _, child := range cur.children {
+				if child != nil && dfs(i+1, child) {
+					return true
+				}
+			}
+		}
+		return false
+	}
+
+	return dfs(0, this.root)
+}
+
+type trie struct {
+	children [26]*trie
+	isEnd    bool
+}
+
+func (t *trie) insert(word string) {
+	cur := t
+	for _, c := range word {
+		c -= 'a'
+		if cur.children[c] == nil {
+			cur.children[c] = new(trie)
+		}
+		cur = cur.children[c]
+	}
+	cur.isEnd = true
+}
+
+/**
+ * Your WordDictionary object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.AddWord(word);
+ * param_2 := obj.Search(word);
+ */
+```
+
+### **C++**
+
+```cpp
+class trie {
+public:
+    vector<trie*> children;
+    bool is_end;
+
+    trie() {
+        children = vector<trie*>(26, nullptr);
+        is_end = false;
+    }
+
+    void insert(const string& word) {
+        trie* cur = this;
+        for (char c : word) {
+            c -= 'a';
+            if (cur->children[c] == nullptr) {
+                cur->children[c] = new trie;
+            }
+            cur = cur->children[c];
+        }
+        cur->is_end = true;
+    }
+};
+
+class WordDictionary {
+private:
+    trie* root;
+
+public:
+    WordDictionary() : root(new trie) {}
+
+    void addWord(string word) {
+        root->insert(word);
+    }
+
+    bool search(string word) {
+        return dfs(word, 0, root);
+    }
+
+private:
+    bool dfs(const string& word, int i, trie* cur) {
+        if (i == word.size()) {
+            return cur->is_end;
+        }
+        char c = word[i];
+        if (c != '.') {
+            trie* child = cur->children[c - 'a'];
+            if (child != nullptr && dfs(word, i + 1, child)) {
+                return true;
+            }
+        } else {
+            for (trie* child : cur->children) {
+                if (child != nullptr && dfs(word, i + 1, child)) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+};
+
+/**
+ * Your WordDictionary object will be instantiated and called as such:
+ * WordDictionary* obj = new WordDictionary();
+ * obj->addWord(word);
+ * bool param_2 = obj->search(word);
+ */
+```
+
 ### **...**
 
 ```

solution/0200-0299/0211.Design Add and Search Words Data Structure/README_EN.md

@@ -165,6 +165,144 @@ class WordDictionary {
  */
 ```
 
+### **Go**
+
+```go
+type WordDictionary struct {
+	root *trie
+}
+
+func Constructor() WordDictionary {
+	return WordDictionary{new(trie)}
+}
+
+func (this *WordDictionary) AddWord(word string) {
+	this.root.insert(word)
+}
+
+func (this *WordDictionary) Search(word string) bool {
+	n := len(word)
+
+	var dfs func(int, *trie) bool
+	dfs = func(i int, cur *trie) bool {
+		if i == n {
+			return cur.isEnd
+		}
+		c := word[i]
+		if c != '.' {
+			child := cur.children[c-'a']
+			if child != nil && dfs(i+1, child) {
+				return true
+			}
+		} else {
+			for _, child := range cur.children {
+				if child != nil && dfs(i+1, child) {
+					return true
+				}
+			}
+		}
+		return false
+	}
+
+	return dfs(0, this.root)
+}
+
+type trie struct {
+	children [26]*trie
+	isEnd    bool
+}
+
+func (t *trie) insert(word string) {
+	cur := t
+	for _, c := range word {
+		c -= 'a'
+		if cur.children[c] == nil {
+			cur.children[c] = new(trie)
+		}
+		cur = cur.children[c]
+	}
+	cur.isEnd = true
+}
+
+/**
+ * Your WordDictionary object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.AddWord(word);
+ * param_2 := obj.Search(word);
+ */
+```
+
+### **C++**
+
+```cpp
+class trie {
+public:
+    vector<trie*> children;
+    bool is_end;
+
+    trie() {
+        children = vector<trie*>(26, nullptr);
+        is_end = false;
+    }
+
+    void insert(const string& word) {
+        trie* cur = this;
+        for (char c : word) {
+            c -= 'a';
+            if (cur->children[c] == nullptr) {
+                cur->children[c] = new trie;
+            }
+            cur = cur->children[c];
+        }
+        cur->is_end = true;
+    }
+};
+
+class WordDictionary {
+private:
+    trie* root;
+
+public:
+    WordDictionary() : root(new trie) {}
+
+    void addWord(string word) {
+        root->insert(word);
+    }
+
+    bool search(string word) {
+        return dfs(word, 0, root);
+    }
+
+private:
+    bool dfs(const string& word, int i, trie* cur) {
+        if (i == word.size()) {
+            return cur->is_end;
+        }
+        char c = word[i];
+        if (c != '.') {
+            trie* child = cur->children[c - 'a'];
+            if (child != nullptr && dfs(word, i + 1, child)) {
+                return true;
+            }
+        } else {
+            for (trie* child : cur->children) {
+                if (child != nullptr && dfs(word, i + 1, child)) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+};
+
+/**
+ * Your WordDictionary object will be instantiated and called as such:
+ * WordDictionary* obj = new WordDictionary();
+ * obj->addWord(word);
+ * bool param_2 = obj->search(word);
+ */
+```
+
 ### **...**
 
 ```

solution/0200-0299/0211.Design Add and Search Words Data Structure/Solution.cpp

@@ -0,0 +1,66 @@
+class trie {
+public:
+    vector<trie*> children;
+    bool is_end;
+
+    trie() {
+        children = vector<trie*>(26, nullptr);
+        is_end = false;
+    }
+
+    void insert(const string& word) {
+        trie* cur = this;
+        for (char c : word) {
+            c -= 'a';
+            if (cur->children[c] == nullptr) {
+                cur->children[c] = new trie;
+            }
+            cur = cur->children[c];
+        }
+        cur->is_end = true;
+    }
+};
+
+class WordDictionary {
+private:
+    trie* root;
+
+public:
+    WordDictionary() : root(new trie) {}
+
+    void addWord(string word) {
+        root->insert(word);
+    }
+
+    bool search(string word) {
+        return dfs(word, 0, root);
+    }
+
+private:
+    bool dfs(const string& word, int i, trie* cur) {
+        if (i == word.size()) {
+            return cur->is_end;
+        }
+        char c = word[i];
+        if (c != '.') {
+            trie* child = cur->children[c - 'a'];
+            if (child != nullptr && dfs(word, i + 1, child)) {
+                return true;
+            }
+        } else {
+            for (trie* child : cur->children) {
+                if (child != nullptr && dfs(word, i + 1, child)) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+};
+
+/**
+ * Your WordDictionary object will be instantiated and called as such:
+ * WordDictionary* obj = new WordDictionary();
+ * obj->addWord(word);
+ * bool param_2 = obj->search(word);
+ */