字符串朴素匹配算法

#include <iostream>
#include <string.h>

//朴素匹配算法
using namespace std;
char str[] ="abcacbbc";
char pattern[] ="cbbc";

int index()
{
    int slen = strlen(str);
    int plen = strlen(pattern);
    //cout<<
    int i,j,k;

    i=0;j=0;k=0;
    while( (i <= (slen - plen)) && (j < plen) ) //边界已验证
    {
        if( str[i+k] == pattern[j] )
            ++k,++j;
        else
            i=i+1,k=0,j=0;
    }
    if(j == plen)
        return i;
    else
        return -1;
}
int main()
{
    cout << "Hello world!" << endl;
    cout<<index()<<endl;
    return 0;
}