【字符串】字符串匹配

1.朴素匹配法

#include <iostream>  
using namespace std;  

void naive_string_match( char *txt , char *pat)
{
	int len_txt = strlen(txt);
	int len_pat = strlen(pat);
	int i, j ;
	for( i=0; i<len_txt-len_pat ; i++ ) {
		for( j=0 ; j<len_pat ; j++){
			if( txt[i+j]!=pat[j] ) break;
		}
		if( j == len_pat ) cout<<"position:"<<i<<endl;
	}
}

int main()
{
   char *txt = "AABAACAADAABAAABAA";
   char *pat = "AABA";
   naive_string_match(txt, pat);
}
#include <iostream>  
using namespace