测试题目:
const int maxn = 100;
char s[maxn],p[maxn];
int fail[maxn];
/* p为模式串
** f为保存失配边的数组
**
*/
void getFail(char* p,int* f){
int m = strlen(p);
f[0] = 0; f[1] = 0;
for(int i = 1;i < m;++i){
int j = f[i];
while(j && p[i] != p[j]) j = f[j];
f[i + 1] = p[i] == p[j] ? j + 1 : 0;
}
}
/*
** s为文本串 p为模式串,fail保存失配边
** 匹配成功返回true
** 失败返回false
*/
bool Match(char* s,char* p,int* fail){
getFail(p,fail);//得到fail数值
int m = strlen(p),n = strlen(s);
int i = 0, j = 0;
while(i < n){
while(i < n && j < m && s[i] == s[j]){//新一轮匹配
i++,j++;
}
if(j == m) return true;//匹配成功
j--;
while(j && p[j] != s[i]) j = fail[j];//根据fail跳转
}
return false;
}