28. Implement strStr()

1.问题描述

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().
来自 https://leetcode.com/problems/implement-strstr/description/

2.题目分析

字符串匹配问题，当一次匹配不成功，i需要回溯到本次开始的下一个位置，j回溯到开始位置。若所有字符全部比较完，返回位置。
有以下关系：i-k=j-0；-》k=i-j；所以下一个位置k+1=i-j+1；
.. k .. .. .. i ..
0 .. .. .. j

3.C++代码

//我的代码：（beats 78%）
int strStr(string haystack, string needle) 
{
    int i = 0, j = 0;
    while (i < haystack.length() && j < needle.length())
    {
        if (haystack[i] == needle[j]) { i++; j++; }
        else
        {
            i = i - j + 1;
            j = 0;
        }
    }
    if (j == needle.length())return i - j;
    else return -1;
}
时间复杂度：O(mn)

//另一种方法：
int strStr(string haystack, string needle) {
    string& h = haystack;
    string& n = needle;

    if (h.length() < n.length())
        return -1;

    if (h.empty() && n.empty())
        return 0;

    for (auto it = h.begin(); it != h.end() - n.length() + 1; ++it) {
        if (equal(n.begin(), n.end(), it))
            return it - h.begin();
    }

    return -1;
}

4.string类的equal()函数

//函数模板
template <class InputIterator1, class InputIterator2>
bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2)
{
    while (first1 != last1)
    {
        if (*first1 != *first2)   // or: if (!pred(*first1,*first2)), for pred version
            return false;
        ++first1; ++first2;
    }
    return true;
}