1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61
| class MagicDictionary {
Trie node;
public MagicDictionary() { node = new Trie(); }
public void buildDict(String[] dictionary) { for (String s : dictionary) node.insert(s); }
public boolean search(String searchWord) { return node.query(searchWord, node, 0, false); }
private static class Trie { Trie[] next; boolean isEnd;
public Trie() { next = new Trie[26]; isEnd = false; }
public void insert(String word) { Trie node = this; for (int i = 0; i < word.length(); ++i) { char c = word.charAt(i); if (node.next[c - 'a'] == null) { node.next[c - 'a'] = new Trie(); } node = node.next[c - 'a']; } node.isEnd = true; }
public boolean query(String word, Trie node, int pos, boolean modified) { if (pos == word.length()) return node.isEnd && modified; int idx = word.charAt(pos) - 'a'; if (node.next[idx] != null) { if (query(word, node.next[idx], pos + 1, modified)) return true; } if (!modified) { for (int i = 0; i < 26; ++i) { if (i != idx && node.next[i] != null) { if (query(word, node.next[i], pos + 1, true)) return true; } } } return false; } } }
|