LeetCode_Simple_28. Implement strStr()

2019.1.14

题目描述：

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算法不像是简单难度的题啊。。不过也好，正好复习了一下KMP算法。

KMP算法就不多说了，建议自行查找数据结构中相关资料学习

C++代码：

class Solution {
public:
    void KMP(vector<int>&next,string key){
        next.resize(key.length());
        next[0]=-1;
        int i=0;
        int j=-1;
        while(i<key.length()-1){
            if(j==-1||key[i]==key[j]){
                i++;
                j++;
                next[i]=j;
            }
            else
                j=next[j];
        }
    }
    int strStr(string haystack, string needle) 
    {
        if(needle.size()==0) return 0;
        int i=0,j=0;
        vector<int> next;
        KMP(next,needle);
        while(j==-1||i<haystack.size()&&j<needle.size())
        {
            if(j==-1||haystack[i]==needle[j]){
                i++;
                j++;
            }
            else
                j=next[j];
        }
        if(j==needle.size()) return i-needle.size();
        else return -1;
    }
};

执行时间 ：4ms

PS.提交完看讨论。。。居然有人直接调用indexof函数一行代码：return haystack.indexOf(needle) 直接结束。。。这不是违背了刷题的初衷了么。。建议不要这么做。