简单匹配算法-2

#include <iostream>
#include <string>
using namespace std;

int SimpleMatch(string x1, string x2)
{
    int i=0, j=0;
    while(i<x1.length()&&j<x2.length())
    {
        if(x1[i]==x2[j])
        {
            cout<<i<<":"<<j<<":"<<x1[i]<<endl;
            i++;
            j++;
            
        }
        else
        {
            i=i-j+1;
            j=0;
        }
    }
    if(j==x2.length())
        return i-j;
    else
        return -1;
}

string a1="abcabaaaabaabcac";
string a2="abaabcac";

SimpleMatch(a1, a2)