目录结构
1.题目
给出第一个词 first 和第二个词 second,考虑在某些文本 text 中可能以 "first second third" 形式出现的情况,其中 second 紧随 first 出现,third 紧随 second 出现。
对于每种这样的情况,将第三个词 "third" 添加到答案中,并返回答案。
示例:
输入:text = "alice is a good girl she is a good student", first = "a", second = "good"
输出:["girl","student"]
输入: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
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2.题解
public class Solution1078 {
@Test
public void test1078() {
String text = "alice is a good girl she is a good student", first = "a", second = "good";
System.out.println(Arrays.toString(findOcurrences(text, first, second)));
}
public String[] findOcurrences(String text, String first, String second) {
List<String> list = new ArrayList<>();
String[] t = text.split(" ");
for (int i = 0; i < t.length - 2; i++) {
if (first.equals(t[i]) && second.equals(t[i + 1])) {
list.add(t[i + 2]);
}
}
return list.toArray(new String[0]);
}
}
- 时间复杂度:
- 空间复杂度: