leetcode 28. Implement strStr() (KMP解法)

Implement strStr().

Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Example 1:

Input: haystack = "hello", needle = "ll"
Output: 2

Example 2:

Input: haystack = "aaaaa", needle = "bba"
Output: -1

Clarification:

What should we return when needle is an empty string? This is a great question to ask during an interview.

For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().

---

    public int strStr(String s, String p) {
        if(p.length()==0) return 0;
        //dp[n]=k+p.charAt(k+1)==p.charAt(n)?回:+1;k=dp[n-1]
        int k=-1;
        int[] dp=new int[p.length()];//模式的最长前缀后缀匹配和
        dp[0]=-1;
        for(int i=1;i<p.length();i++){//k代表0到n-1的子串匹配到的最长前缀
            while(k>-1&&p.charAt(i)!=p.charAt(k+1)){
                k=dp[k];//回退到前面的前缀位置
            }
            if(p.charAt(i)==p.charAt(k+1)){
                k=k+1;//最后一位匹配
            }        
            dp[i]=k;
        }
        //匹配
        for(int i=0,j=0;i<s.length();){
            if(s.charAt(i)==p.charAt(j)){
                i++;
                j++;
            }else if(j==0&&s.charAt(i)!=p.charAt(j)){
                i++;
            }else if(j>0&&s.charAt(i)!=p.charAt(j)){
                j=dp[j-1]+1;
            }
            if(j==p.length()){
                return i-j;
            }
        }
        return -1;
   }

参考：https://blog.csdn.net/starstar1992/article/details/54913261