Bigram分词
简介
给出第一个词 first 和第二个词 second,考虑在某些文本 text 中可能以 “first second third” 形式出现的情况,其中 second 紧随 first 出现,third 紧随 second 出现。
对于每种这样的情况,将第三个词 “third” 添加到答案中,并返回答案。
示例 1:
输入:text = “alice is a good girl she is a good student”, first = “a”, second = “good”
输出:[“girl”,“student”]
示例 2:
输入:text = “we will we will rock you”, first = “we”, second = “will”
输出:[“we”,“rock”]
提示:
1 <= text.length <= 1000
text 由一些用空格分隔的单词组成,每个单词都由小写英文字母组成
1 <= first.length, second.length <= 10
first 和 second 由小写英文字母组成
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/occurrences-after-bigram
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题思路
- 将text字符串以空格分割为单词,存在字符串数组中
- 遍历字符串数组,当相邻两个元素与first和second都相等时将第三个元素放在list容器中
- 将list中的数据存入字符串数组answer中
- 返回answer
import java.util.*;
public class Test01 {
public static void main(String[] args) {
String text="alice is a good girl she is a good student";
String first="a";
String second="good";
Solution sol=new Solution();
String[] answer=sol.findOcurrences(text,first,second);
System.out.println(Arrays.toString(answer));
}
}
class Solution {
public String[] findOcurrences(String text, String first, String second) {
String[] letter = text.split(" ");
List<String> list = new ArrayList<>();
for (int i = 0; i < letter.length - 2; i++) {
if (letter[i].equals(first) && letter[i + 1].equals(second)) {
list.add(letter[i + 2]);
}
}
String[] answer = new String[list.size()];
for (int j = 0; j < list.size(); j++) {
answer[j] = list.get(j);
}
return answer;
}
}