[leetcode] 28. Implement strStr()

题目

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().

解题思路：

KMP。 字符匹配用KMP。这道题是easy的原因应该是因为可以调库做。如果用KMP的话应该归为hard。

最近181周赛的最后一道题相当于求KMP中的next数组。

KMP的时间复杂度是O(m+n)，包括了计算匹配数组的O(m)和匹配过程的O(n)。

代码：

class Solution {
public:
    int strStr(string haystack, string needle) {
        int n = needle.size();
        if(n == 0) return 0;

        vector<int> next(n, 0);
        int j = 0, i = 1;
        while(i < n){
            if(needle[i] == needle[j]){
                next[i++] = ++j;
            }
            else{
                if(j > 0) j = next[j-1];
                else{
                    next[i++] = 0;
                }
            }
        }

        int p = 0, k = 0;
        while(k < haystack.size()){
            if(needle[p] == haystack[k]){
                p++; k++;
                if(p == n){
                    return (k - n);
                }
            }
            else{
                if(p > 0) p = next[--p];
                else{
                    k++;
                }
            }
        }
        return -1;
    }
};