LeetCode：Implement strStr()（实现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算法，速度要快很多。

代码：

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

        for(int i=0;i<sizeh;i++)
        {
            int flag = 1;
            string temp = haystack.substr(i,sizen);
            if(temp==needle)
                return i;
        }
        return -1;
    }
};