Horspool算法

/*#include <iostream>

using namespace std;

#define M   8
#define T   376
#define N   512

void ShiftTable( char P[M], char (&Table)[T] );
int HorspoolMatching( char P[M], char TEXT[N] );

int main(int ac, char** av)
{
    char text[N] = "Hello, my name is ArtWalk, I come form China.";
    char p[M] = "ArtWalk";
    cout << text[HorspoolMatching( p , text )] << endl;

    return 0;
}

void ShiftTable( char P[M], char (&Table)[T] ) {
    for ( int i = 0; i != T; ++i ) {
        Table[i] = M - 1;
    }
    for ( int j = 0; j != M - 3; ++j ) {
        Table[ P[j] ] = M - 2 - j;
    }
}

int HorspoolMatching( char P[M], char TEXT[N] ) {

    char Table[T];
    ShiftTable(P, Table);
    int i = M - 2;

    while ( i <= N-2 ) {
        int k = 0;

        while ( k <= M -2 && ( P[M-2-k] == TEXT[i-k] ) ) {
            ++k;
        }
        if ( k == M -1 ) {
            return i - M + 2;
        } else {
            i += Table[ TEXT[i] ];
        }
    }
    return -1;
}*/
/*
 * ×Ö·û´®Æ¥Åä ÊäÈëÔöÇ¿
 * 2011/03/30
 * ArtWalk
 */
/*#include <iostream>

using namespace std;

#define M 8
#define T 376
#define N 512