kmp算法 Java

最新推荐文章于 2024-04-26 14:00:07 发布

无名同学

最新推荐文章于 2024-04-26 14:00:07 发布

阅读量173

点赞数

分类专栏：算法错题集文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/tomorrow_fine/article/details/126826630

版权

算法错题集专栏收录该内容

4 篇文章 0 订阅

订阅专栏

public class KmpTest {
    public static void main(String[] args) {
        System.out.println(new KmpSulution().strStr("abababababc", "ababc"));

        System.out.println(new KmpSulution().strStr("abcabcabcd", "abcde"));
    }

    public int strStr(String haystack, String needle) {
        int i = 0;
        int j = 0;
        int[] next = getNext(needle);
        while (i < haystack.length() && j < needle.length()) {
            if (j == -1 || haystack.charAt(i) == needle.charAt(j)) {
                i++;
                j++;
            } else {
                j = next[j];
            }
        }
        if (j == needle.length()) {
            return i - j;
        } else {
            return -1;
        }
    }

    public int[] getNext(String sub) {
        int[] next = new int[sub.length() + 1];
        int i = 0;
        int j = -1;
        while (i < sub.length()) {
            if (j == -1 || sub.charAt(i) == sub.charAt(j)) {
                next[++i] = ++j;
            } else {
                j = next[j];
            }
        }
        return next;
    }
}