题目:
在英语中,有一个叫做 词根(root) 的概念,
它可以跟着其他一些词组成另一个较长的单词——我们称这个词为 继承词(successor)。
例如,词根an,跟随着单词 other(其他),可以形成新的单词 another(另一个)。
现在,给定一个由许多词根组成的词典和一个句子,需要将句子中的所有继承词用词根替换掉。
如果继承词有许多可以形成它的词根,则用最短的词根替换它。
需要输出替换之后的句子。
------------------
示例:
输入:dictionary = ["cat","bat","rat"], sentence = "the cattle was rattled by the battery"
输出:"the cat was rat by the bat"
示例 2:
输入:dictionary = ["a","b","c"], sentence = "aadsfasf absbs bbab cadsfafs"
输出:"a a b c"
示例 3:
输入:dictionary = ["a", "aa", "aaa", "aaaa"], sentence = "a aa a aaaa aaa aaa aaa aaaaaa bbb baba ababa"
输出:"a a a a a a a a bbb baba a"
示例 4:
输入:dictionary = ["catt","cat","bat","rat"], sentence = "the cattle was rattled by the battery"
输出:"the cat was rat by the bat"
示例 5:
输入:dictionary = ["ac","ab"], sentence = "it is abnormal that this solution is accepted"
输出:"it is ab that this solution is ac"
提示:
1 <= dictionary.length <= 1000
1 <= dictionary[i].length <= 100
dictionary[i] 仅由小写字母组成。
1 <= sentence.length <= 10^6
sentence 仅由小写字母和空格组成。
sentence 中单词的总量在范围 [1, 1000] 内。
sentence 中每个单词的长度在范围 [1, 1000] 内。
sentence 中单词之间由一个空格隔开。
sentence 没有前导或尾随空格。
---------------------
思路:
StringBuilder append(char [] cstr,int iset,int ilength):
此方法将char数组参数的子数组的字符串表示形式附加到此序列。
从索引iset开始的char数组cstr的字符按顺序附加到此序列的内容中。该序列的长度增加ilength的值。
--------------
class Solution {
static class Trie {//定义字典树 类
private final Trie[] next;
private boolean isEnd;
public Trie() {
this.next = new Trie[26];
this.isEnd = false;
}
public void insert (String word) {
Trie root = this;
for (int i = 0; i < word.length(); i++) {
int index = word.charAt(i) - 'a'; //!获得索引
if (root.next[index] == null) {
root.next[index] = new Trie();
}
root = root.next[index];
}
root.isEnd = true;
}
public int contains(String word) {//判断传入单词的某个前缀是否存在于字典树中
Trie root = this;
for (int i = 0; i < word.length(); i++) {
root = root.next[word.charAt(i) - 'a'];//!
if (root == null) return -1;
if (root.isEnd) return i + 1;//如果存在,返回该前缀的长度 !!
}//如果到达了一个词根单词的尽头,那么次数得到的一定是最短词根
return -1;
}
}
public String replaceWords(List<String> dictionary, String sentence) {
Trie root = new Trie();//构造一个字典树,并将dictionary中的所有单词都存入
for (String word : dictionary) {
root.insert(word);//!
}
String[] words = sentence.split(" ");//!
StringBuilder sb = new StringBuilder();
for (int i = 0; i < words.length; i++) {
if (root.contains(words[i]) > 0) {
sb.append(words[i], 0, root.contains(words[i]));//!
}else {
sb.append(words[i]);
}
sb.append(' ');
}
sb.deleteCharAt(sb.length() - 1);//删除最后一个多余的空格 !!
return sb.toString();
}
}
法二:startsWith
对词根排序,遇到第一个匹配的词根就直接替换
startsWith() 方法用于检测字符串是否以指定的前缀开始
class Solution {
public String replaceWords(List<String> dictionary, String sentence) {
Collections.sort(dictionary);
StringBuilder res = new StringBuilder();
for(int i = 0, j = 0; j < sentence.length(); j++, i = j) {
while(j < sentence.length() && sentence.charAt(j) != ' ') {
j++;
}
String word = sentence.substring(i, j);
for(String str : dictionary) {
if(word.startsWith(str)) {
word = str;
break;
}
}
if(i > 0) res.append(" ");
res.append(word);
}
return res.toString();
}
}
一刷246-剑指 Offer II 063. 替换单词(同:648. 单词替换)
于 2022-03-29 22:53:54 首次发布