Leetcode28 Java实现

Leetcode28 Java实现

代码实现（kmp）

class Solution {
    public int strStr(String haystack, String needle) {
        
       
        if(needle.length()<1){
            return 0;
        }
       
        char[] ha = haystack.toCharArray();
        char[] ne = needle.toCharArray();
        int hi=0;
        int ni = 0;
        int [] next = getNextArray(ne);
        while(hi0){
                j=next[j];
            }else{
                next[i++]=0;
            }
        }
        return next;
    }
}