字符串匹配KMP

public class Main{
	// 获取next数组,next表示前后公共缀的长度
	private static int[] getNext(String t) {
	     int[] next = new int[t.length()];
	     next[0] = -1;
	
	     int j = 0, k = -1;
	     char[] cs = t.toCharArray();
	     while(j < cs.length - 1){
	         if(k == -1 || cs[j] == cs[k]){
	             j++;k++;
	             next[j] = k;
	         }else{
	             k = next[k];
	         }
	     }
	     return next;
	 }
    // 判断s是否包含t子串
	private static boolean isContains(String s, String t, int[] next) {
        int i = 0, j = 0;
        char[] cs = s.toCharArray();
        char[] tcs = t.toCharArray();

        while(i < s.length() && j < t.length()){
            if(j == -1 || cs[i] == tcs[j]){
                i++;j++;
            }else{
                j = next[j];
            }
        }
        // t走到结尾了，表示包含
        return j >= t.length();
    }
    /**
    时间复杂度:O(m+n)
    **/
	public static void main(String[] args) {
        String s = "aaaaaab";
        String t = "aaab";
        int[] next = getNext(s);
        boolean b = isContains(s, t, next);
        System.out.println(b);
    }
}