Occurrences After Bigram

second third", where second comes immediately after first, and third comes immediately after second.

Return an array of all the words third for each occurrence of "first second third".

Example 1:

Input: text = "alice is a good girl she is a good student", first = "a", second = "good"
Output: ["girl","student"]
Example 2:

Input: text = "we will we will rock you", first = "we", second = "will"
Output: ["we","rock"]
Constraints:

1 <= text.length <= 1000
text consists of lowercase English letters and spaces.
All the words in text a separated by a single space.
1 <= first.length, second.length <= 10
first and second consist of lowercase English letters.

思路一:分割字符串,然后比较。注意 first, second, third 三个字符串都相同的特殊情况。用了分割执行速度会慢很多,但是代码会简洁很多

public String[] findOcurrences(String text, String first, String second) {
    String[] arr = text.split("\\s");

    List<String> result = new ArrayList<>();
    for (int i = 0; i < arr.length - 2; i++) {
        if (arr[i].equals(first) && arr[i + 1].equals(second)) {
            result.add(arr[i + 2]);
        }
    }

    return result.toArray(new String[0]);
}

原文地址:http://www.cnblogs.com/iyiluo/p/16833201.html

1. 本站所有资源来源于用户上传和网络,如有侵权请邮件联系站长! 2. 分享目的仅供大家学习和交流,请务用于商业用途! 3. 如果你也有好源码或者教程,可以到用户中心发布,分享有积分奖励和额外收入! 4. 本站提供的源码、模板、插件等等其他资源,都不包含技术服务请大家谅解! 5. 如有链接无法下载、失效或广告,请联系管理员处理! 6. 本站资源售价只是赞助,收取费用仅维持本站的日常运营所需! 7. 如遇到加密压缩包,默认解压密码为"gltf",如遇到无法解压的请联系管理员! 8. 因为资源和程序源码均为可复制品,所以不支持任何理由的退款兑现,请斟酌后支付下载 声明:如果标题没有注明"已测试"或者"测试可用"等字样的资源源码均未经过站长测试.特别注意没有标注的源码不保证任何可用性