jimmylopez的专栏

原创 java版的KMP算法 欢迎吐槽

public class kmp{ static int KMP(String S,String T, int pos){ if(S.length() < T.length()){ return -1; } char[] s = new char[S.length()]; char[] t = new char[T.length()]; for(int k = 0;