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

---

方法1：O(nm), 暴力求解，遍历原数组，判断第一个值相等后就遍历needle数组。

class Solution {
public:
    int strStr(string haystack, string needle) {
        int n=haystack.size();
        int m=needle.size();
        if(m==0) return 0;
        for(int i=0;i<n-m+1;i++){
            if(haystack[i]==needle[0]){
                int j;
                for(j=1;j<m;j++){
                    if(haystack[i+j]!=needle[j]) break;
                }
                if(j==m) return i;
            }
        }
        return -1;
    }
};

注：

1.要对needle为空预先判断，防止取数组时为空

2.i<n-m+1