【leetcode】28. Implement strStr()

Problem

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

Solution

1、C （一般解法）

int strStr(char* haystack, char* needle)
{
    int i, j, temp;
    int len_hay = strlen(haystack);
    int len_nee = strlen(needle);
    if (len_nee == 0) {
        return 0;
    }
    for (i = 0; i < len_hay; i++) {
        temp = i;
        j = 0;
        while (*(haystack + temp) == *(needle + j) || j == len_nee) {
            if (j == len_nee) {
                return i;
            } else {
                j++;
                temp++;
            }
        }
    }
    return -1;
}

2、 C （KMP）