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

在字符串找到与子串第一个字符相同的位置，逐个位置匹配，不匹配则后移

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