Skip to content

Commit

Permalink
feat: update solutions to lc problem: No.0211
Browse files Browse the repository at this point in the history 
No.0211.Design Add and Search Words Data Structure
  • Loading branch information
@yanglbme
yanglbme committed Oct 19, 2021
1 parent 6ab3755 commit 9525eaa
Show file tree
Hide file tree
Showing 4 changed files with 106 additions and 130 deletions.
80 changes: 36 additions & 44 deletions solution/0200-0299/0211.Design Add and Search Words Data Structure/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -72,36 +72,33 @@ class Trie:
class WordDictionary:

def __init__(self):
"""
Initialize your data structure here.
"""
self.trie = Trie()

def addWord(self, word: str) -> None:
node = self.trie
for c in word:
index = ord(c) - ord('a')
if node.children[index] is None:
node.children[index] = Trie()
node = node.children[index]
idx = ord(c) - ord('a')
if node.children[idx] is None:
node.children[idx] = Trie()
node = node.children[idx]
node.is_end = True

def search(self, word: str) -> bool:
return self._search(word, self.trie)

def _search(self, word: str, node: Trie) -> bool:
for i in range(len(word)):
c = word[i]
index = ord(c) - ord('a')
if c != '.' and node.children[index] is None:
return False
if c == '.':
for j in range(26):
if node.children[j] is not None and self._search(word[i + 1:], node.children[j]):
return True
return False
node = node.children[index]
return node.is_end
def search(word, node):
for i in range(len(word)):
c = word[i]
idx = ord(c) - ord('a')
if c != '.' and node.children[idx] is None:
return False
if c == '.':
for child in node.children:
if child is not None and search(word[i + 1:], child):
return True
return False
node = node.children[idx]
return node.is_end

return search(word, self.trie)

# Your WordDictionary object will be instantiated and called as such:
# obj = WordDictionary()
Expand All @@ -114,56 +111,51 @@ class WordDictionary:
<!-- 这里可写当前语言的特殊实现逻辑 -->

```java
class WordDictionary {
class Trie {
Trie[] children;
boolean isEnd;
Trie() {
children = new Trie[26];
isEnd = false;
}
}
class Trie {
Trie[] children = new Trie[26];
boolean isEnd;
}

class WordDictionary {
private Trie trie;

/** Initialize your data structure here. */
public WordDictionary() {
trie = new Trie();
}

public void addWord(String word) {
Trie node = trie;
for (int i = 0; i < word.length(); ++i) {
char c = word.charAt(i);
int index = c - 'a';
if (node.children[index] == null) {
node.children[index] = new Trie();
for (char c : word.toCharArray()) {
int idx = c - 'a';
if (node.children[idx] == null) {
node.children[idx] = new Trie();
}
node = node.children[index];
node = node.children[idx];
}
node.isEnd = true;
}

public boolean search(String word) {
return search(word, trie);
}

private boolean search(String word, Trie node) {
for (int i = 0; i < word.length(); ++i) {
char c = word.charAt(i);
int index = c - 'a';
if (c != '.' && node.children[index] == null) {
int idx = c - 'a';
if (c != '.' && node.children[idx] == null) {
return false;
}
if (c == '.') {
for (int j = 0; j < 26; ++j) {
if (node.children[j] != null && search(word.substring(i + 1), node.children[j])) {
for (Trie child : node.children) {
if (child != null && search(word.substring(i + 1), child)) {
return true;
}
}
return false;
}
node = node.children[index];
node = node.children[idx];
}
return node.isEnd;
}
Expand Down
80 changes: 36 additions & 44 deletions solution/0200-0299/0211.Design Add and Search Words Data Structure/README_EN.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -62,36 +62,33 @@ class Trie:
class WordDictionary:

def __init__(self):
"""
Initialize your data structure here.
"""
self.trie = Trie()

def addWord(self, word: str) -> None:
node = self.trie
for c in word:
index = ord(c) - ord('a')
if node.children[index] is None:
node.children[index] = Trie()
node = node.children[index]
idx = ord(c) - ord('a')
if node.children[idx] is None:
node.children[idx] = Trie()
node = node.children[idx]
node.is_end = True

def search(self, word: str) -> bool:
return self._search(word, self.trie)

def _search(self, word: str, node: Trie) -> bool:
for i in range(len(word)):
c = word[i]
index = ord(c) - ord('a')
if c != '.' and node.children[index] is None:
return False
if c == '.':
for j in range(26):
if node.children[j] is not None and self._search(word[i + 1:], node.children[j]):
return True
return False
node = node.children[index]
return node.is_end
def search(word, node):
for i in range(len(word)):
c = word[i]
idx = ord(c) - ord('a')
if c != '.' and node.children[idx] is None:
return False
if c == '.':
for child in node.children:
if child is not None and search(word[i + 1:], child):
return True
return False
node = node.children[idx]
return node.is_end

return search(word, self.trie)

# Your WordDictionary object will be instantiated and called as such:
# obj = WordDictionary()
Expand All @@ -102,56 +99,51 @@ class WordDictionary:
### **Java**

```java
class WordDictionary {
class Trie {
Trie[] children;
boolean isEnd;
Trie() {
children = new Trie[26];
isEnd = false;
}
}
class Trie {
Trie[] children = new Trie[26];
boolean isEnd;
}

class WordDictionary {
private Trie trie;

/** Initialize your data structure here. */
public WordDictionary() {
trie = new Trie();
}

public void addWord(String word) {
Trie node = trie;
for (int i = 0; i < word.length(); ++i) {
char c = word.charAt(i);
int index = c - 'a';
if (node.children[index] == null) {
node.children[index] = new Trie();
for (char c : word.toCharArray()) {
int idx = c - 'a';
if (node.children[idx] == null) {
node.children[idx] = new Trie();
}
node = node.children[index];
node = node.children[idx];
}
node.isEnd = true;
}

public boolean search(String word) {
return search(word, trie);
}

private boolean search(String word, Trie node) {
for (int i = 0; i < word.length(); ++i) {
char c = word.charAt(i);
int index = c - 'a';
if (c != '.' && node.children[index] == null) {
int idx = c - 'a';
if (c != '.' && node.children[idx] == null) {
return false;
}
if (c == '.') {
for (int j = 0; j < 26; ++j) {
if (node.children[j] != null && search(word.substring(i + 1), node.children[j])) {
for (Trie child : node.children) {
if (child != null && search(word.substring(i + 1), child)) {
return true;
}
}
return false;
}
node = node.children[index];
node = node.children[idx];
}
return node.isEnd;
}
Expand Down
35 changes: 15 additions & 20 deletions solution/0200-0299/0211.Design Add and Search Words Data Structure/Solution.java
View file
Original file line number Diff line number Diff line change
@@ -1,13 +1,9 @@
class WordDictionary {
class Trie {
Trie[] children;
boolean isEnd;
Trie() {
children = new Trie[26];
isEnd = false;
}
}
class Trie {
Trie[] children = new Trie[26];
boolean isEnd;
}

class WordDictionary {
private Trie trie;

/** Initialize your data structure here. */
Expand All @@ -17,13 +13,12 @@ public WordDictionary() {

public void addWord(String word) {
Trie node = trie;
for (int i = 0; i < word.length(); ++i) {
char c = word.charAt(i);
int index = c - 'a';
if (node.children[index] == null) {
node.children[index] = new Trie();
for (char c : word.toCharArray()) {
int idx = c - 'a';
if (node.children[idx] == null) {
node.children[idx] = new Trie();
}
node = node.children[index];
node = node.children[idx];
}
node.isEnd = true;
}
Expand All @@ -35,19 +30,19 @@ public boolean search(String word) {
private boolean search(String word, Trie node) {
for (int i = 0; i < word.length(); ++i) {
char c = word.charAt(i);
int index = c - 'a';
if (c != '.' && node.children[index] == null) {
int idx = c - 'a';
if (c != '.' && node.children[idx] == null) {
return false;
}
if (c == '.') {
for (int j = 0; j < 26; ++j) {
if (node.children[j] != null && search(word.substring(i + 1), node.children[j])) {
for (Trie child : node.children) {
if (child != null && search(word.substring(i + 1), child)) {
return true;
}
}
return false;
}
node = node.children[index];
node = node.children[idx];
}
return node.isEnd;
}
Expand Down
41 changes: 19 additions & 22 deletions solution/0200-0299/0211.Design Add and Search Words Data Structure/Solution.py
View file
Original file line number Diff line number Diff line change
Expand Up @@ -8,36 +8,33 @@ def __init__(self):
class WordDictionary:

def __init__(self):
"""
Initialize your data structure here.
"""
self.trie = Trie()

def addWord(self, word: str) -> None:
node = self.trie
for c in word:
index = ord(c) - ord('a')
if node.children[index] is None:
node.children[index] = Trie()
node = node.children[index]
idx = ord(c) - ord('a')
if node.children[idx] is None:
node.children[idx] = Trie()
node = node.children[idx]
node.is_end = True

def search(self, word: str) -> bool:
return self._search(word, self.trie)

def _search(self, word: str, node: Trie) -> bool:
for i in range(len(word)):
c = word[i]
index = ord(c) - ord('a')
if c != '.' and node.children[index] is None:
return False
if c == '.':
for j in range(26):
if node.children[j] is not None and self._search(word[i + 1:], node.children[j]):
return True
return False
node = node.children[index]
return node.is_end
def search(word, node):
for i in range(len(word)):
c = word[i]
idx = ord(c) - ord('a')
if c != '.' and node.children[idx] is None:
return False
if c == '.':
for child in node.children:
if child is not None and search(word[i + 1:], child):
return True
return False
node = node.children[idx]
return node.is_end

return search(word, self.trie)

# Your WordDictionary object will be instantiated and called as such:
# obj = WordDictionary()
Expand Down

0 comments on commit 9525eaa

Please sign in to comment.