LC.P648[单词替换]

方法一:字典树

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
class Solution {
public String replaceWords(List<String> dictionary, String sentence) {
Trie trie = new Trie();
for (String s : dictionary) trie.insert(s);
StringBuilder builder = new StringBuilder();
for (String word : sentence.split(" ")) {
builder.append(trie.query(word)).append(" ");
}
return builder.substring(0, builder.length() - 1);
}

private static class Trie {
private Trie[] next;
private 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 String query(String word) {
Trie node = this;
for (int i = 0; i < word.length(); ++i) {
char c = word.charAt(i);
if (node.next[c - 'a'] == null) break;
if (node.next[c - 'a'].isEnd) return word.substring(0, i + 1);
node = node.next[c - 'a'];
}
return word;
}
}
}
  • 时间复杂度:$O(m + n)$,其中$n$为$dictionary$的长度,$m$为$sentence$的长度
  • 空间复杂度:$O(n \times C)$,其中$C = 26$