#13 strStr

题目描述：

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.

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.

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)

Interface

int strStr(const char *source, const char *target)

题目思路：

这里就用简单粗暴的O(n^2)去完成，将target字段与source字段从index = 0开始去一一对应，第一个能对应上的index就是所求答案。用C++实现的话有一些需要注意的点：

1. source == NULL 与 source == ""情况不同

2. string.substr这个函数需要自己实现，不能调用在char*上

My code below (AC = 14ms)

class Solution {
public:
    /**
     * Returns a index to the first occurrence of target in source,
     * or -1  if target is not part of source.
     * @param source string to be scanned.
     * @param target string containing the sequence of characters to match.
     */
    int strStr(const char *source, const char *target) {
        // write your code here
        // deal with null ptr cases: no match
        if (source == NULL || target == NULL) {
            return -1;
        }
        
        // Get the length of 2 strings
        int lens = 0, lent = 0;
        while (source[lens] != '\0') {
            lens++;
        }
        while (target[lent] != '\0') {
            lent++;
        }
        
        // if target == "", return 0
        if (lent == 0) return 0;
        
        // search for the first matching index
        for (int i = 0; i <= lens - lent; i++) {
            if (source[i] == target[0]) {
                string tmps = getSubStr(source, i, lent);
                if (tmps == target) {
                    return i;
                }
            }
        }
        
        return -1;
    }
    
    // source is in char*, not able to use substr, use self-defined function instead
    string getSubStr(const char *source, int i, int len) {
        string str = "";
        int idx = i;
        
        while (idx - i < len) {
            str += source[idx++];
        }
        
        return str;
    }
};