KMP算法代码实现

求子串出现的位置
package com.byc.day1;

import java.util.Arrays;

public class KMP {
public static void main(String[] args) {
String A = "aabaabaaxaabaabayaaabaabaaaqqq";
String B = "aabaabaaa";
System.out.println(A.substring(18));
int[] indexArray = getIndexArray(B.toCharArray());
System.out.println(getIndexOfSubStr2(A.toCharArray(),B.toCharArray(),indexArray));
}

public static int[] getIndexArray(char[] pattern){

KMP算法代码实现最先出现在Python成神之路。