匹配子串

来源于LeetCode上的一到字符串的题
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)

注：题目要求O(n2) is acceptable.这里列了所有的情况
一、暴力匹配

#include "stdafx.h"
#include  "string"
#include "iostream"
using namespace std;
int substring(const string& s, const string& t)
{
    auto i = s.begin();
    auto j = t.begin();
    while (i != s.end() && j != t.end()) {//注意这里一定要是逻辑与
        if (*i == *j) {
            i++;
            j++;

        }
        else {
        /*j - (t.begin()）表示偏移量，当一次匹配不成功后，指针要归位，回到偏移前的状态，注意下面两条语句顺序不能颠倒*/
            i = i - (j - (t.begin()))+1; 
            j = t.begin();
        }
    }
    if (j == t.end())
        return ((i-(j-t.begin()))-s.begin()); //返回索引
    else
        return -1;

}
int main()
{
    cout << "结果是：" << substring("jjjkanyan", "kan") << endl;
    system("pause");
    return 0;
}