void addWord(word)
bool search(word)
root ""
abcdefghijjklmnopqrstuvwxyz
root ""
..........fghijjklmnopqrs........
root
/ \ \
t a b
| | |
h n y
| | \ |
e s y e
/ | |
i r w
| | |
r e e
|
r
2. Implementation
class TrieNode { char c; HashMap3. Similar Oneschildren = new HashMap (); boolean isLeaf; public TrieNode(){} public TriNode(char c) { this.c = c; } } public class WordDictionary { }
No comments:
Post a Comment