#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAXSTRLEN 255
typedef unsigned char HString[MAXSTRLEN + 1];//0号单元存放串的长度 ???
bool StrAssign (HString S, char *chars);
int Index(HString S, HString T, int pos);
int Index_KMP(HString S, HString T, int pos);
void get_next(HString T, int next[]);
int main()
{
HString S;
HString T;
char chars1[] = “abcdefgh”;
char chars2[] = “cde”;
StrAssign(S, chars1);
StrAssign(T, chars2);
int pos = 1;
printf(“调用Index函数输出串T:cde在串S中的位置为:%d\n”, Index(S, T, pos));
printf(“调用Index_KMP函数输出串T:cde在串S中的位置为:%d\n”, Index_KMP(S, T, pos));
return 0;
}
bool StrAssign (HString S, char *chars)
{
if(strlen(chars) > MAXSTRLEN)
return false;
else
{
S[0] = strlen(chars);
for(int i = 1; i <= S[0]; i ++)
S[i] = *(chars + i - 1);//T[i] = chars[i - 1];可以吗?
return true;
}
}
int Index(HString S, HString T, int pos)//返回子串T在主串S中第pos个字符之后的位置。若不存在,则函数值为0
{
//其中T为非空,1<=pos<=S.length
int i = pos;
int j = 1;
while(i <= S[0] && j <= T[0])
{
if(S[i] == T[j])
{
i ++;
j ++;
}
else
{
i = i - j + 2;
j = 1;
}
}
if(j > T[0])
return i - T[0];
else
return 0;
}
int Index_KMP(HString S, HString T, int pos)//利用模式串T的next函数求T在主串S中第pos个字符之后的位置KMP算法
{
//其中T非空,1<=pos<=S.length
int i = pos;
int j = 1;
int next[MAXSTRLEN];
get_next(T, next);
while(i <= S[0] && j <= T[0])
{
if(j == 0 || S[i] == T[j])//j = ?
{
i ++;
j ++;
}
else
j = next[j];
}
if(j > T[0])
return i - T[0];
else
return 0;
}
void get_next(HString T, int next[])//还要修改,串的堆分配
{
int i=1;next[1]=0;int j=0;
while(i<T[0]){
if (j==0||T[i]==T[j]){++i;++j;next[i]=j;}
else j=next[j];
}
}