28. Implement strStr() [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().

 

 

 

int strStr(char *haystack, char *needle){
    if (NULL == needle)
        return 0;
    if (NULL == haystack)
        return -1;
    
    int len1 = strlen(haystack);
    int len2 = strlen(needle);
    if (len1 < len2)
        return -1;
    
    for (int i = 0; i <= len1 - len2; i++) {
        int j = 0;
        for (j = 0; j < len2; j++) {
            if (needle[j] != haystack[i + j])
                break;
        }
        if (j == len2)
            return i;
    }
    return -1;
}