String：strStr()求一个字符串在另一个字符串中第一次出现的索引

Problem Statement

For a given source string and a target string, you should output the first

index(from 0) of target string in source string.

If target does not exist in source, just return -1.

Example

If source = “source” and target = “target”, return -1.

If source = “abcdabcdefg” and target = “bcd”, return 1.
Challenge

O(n2) is acceptable. Can you implement an O(n) algorithm? (hint: KMP)
Clarification

Do I need to implement KMP Algorithm in a real interview?

Not necessary. When you meet this problem in a real interview, the interviewer may just want to test your basic implementation ability. But make sure your confirm with the interviewer first.

PYTHON:

class Solution:
    def strStr(self, source, target):
        if (source is None or target is None):
            return -1

        for i in range(len(source) - len(target) + 1):
            for j in range(len(target)):
                if (source[i + j] != target[j]):
                    break

            else:
                return i
        return -1

注意：Python 代码中的else接的是for 而不是if, 其含义为no break, 属于比较 Pythonic 的用法

C++:

class Solution {
public:
    int strStr(string haystack, string needle) {
        if (haystack.empty() && needle.empty()) return 0;
        if (haystack.empty()) return -1;
        if (needle.empty()) return 0;
        // in case of overflow for negative
        if (haystack.size() < needle.size()) return -1;

        for (int i = 0; i < haystack.size() - needle.size() + 1; i++) {
            string::size_type j = 0;
            for (; j < needle.size(); j++) {
                if (haystack[i + j] != needle[j]) break;
            }
            if (j == needle.size()) return i;
        }
        return -1;
    }
};