28. Implement strStr()

字符串中第一次出现给定字符串的位置

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