看了数据结构,下面把暴力匹配、KMP算法的实现记录下来,备忘
(1)暴力匹配
int findsubstr(char *strmain,char *strsub)
{
int pos = -1;
if (strmain==NULL||strsub==NULL)
{
return pos;
}
int i = 0,j = 0;
while (i<strlen(strmain)&&j<strlen(strsub))
{
if (strmain[i]==strsub[j])
{
i++;
j++;
}
else
{
i = i-j+2;
j=0;
}
}
if (j>=strlen(strsub))
{
pos = i-j;
}
return pos;
}
(2)KMP算法
void getnext(char *p,int *next)
{
int idx_p, len_p, k;
idx_p = 0;
len_p = strlen(p);
k = 0;
next[0] = 0;
while(idx_p < len_p -1)
{
if ((k == 0) || *(p+idx_p) == *(p+k))
{
idx_p = idx_p + 1;
k = k + 1;
next[idx_p] = k;
}
else
{
k = next[k];
}
}
}
int kmp(char *s, char *p)
{
int len_p, len_s, idx_p, idx_s;
len_p = strlen(p);
len_s = strlen(s);
idx_p = idx_s = 0;
int *next = new int(len_p);
memset(next,0,len_p);
getnext(p,next);
while ((idx_p < len_p) && (idx_s < len_s))
{
if ((idx_p == 0) || *(p+idx_p) == *(s+idx_s))
{
++idx_p;
++idx_s;
}
else
{
idx_p = next[idx_p];
}
}
if (idx_p >= len_p)
{
delete []next;
return (idx_s - len_p);
}
delete []next;
return -1;
}