LeetCode Implement strStr() --- KMP

Implement strStr().

Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.

KMP(“看毛片”算法）

public class Solution {
    public String strStr(String haystack, String needle) {
        if (needle.equals("")) return haystack;
        if (haystack.equals("")) return null;
        int []next = pattern(needle);
        return str(haystack, needle, next);
}

 public static String str(String a, String b, int[] next){
int j = -1;
for(int i = 0; i < a.length(); i++){
while( (j >= 0)&&(b.charAt(j + 1) != a.charAt(i)) ) j = next[j];
if (a.charAt(i) == b.charAt(j + 1) ) j++;

if (j == b.length()-1) return a.substring(i - b.length() + 1); 

}
return null;
    }

public static int[] pattern(String a){
int []next = new int[a.length()];
int j = -1;
next[0] = -1;
for(int i = 1; i < a.length(); i++){
while( (j >= 0)&&( a.charAt(j + 1) != a.charAt(i))) j = next[j];
if (a.charAt(j + 1) == a.charAt(i)) j++;
next[i] = j;
}
return next;
}
       
}