408/dataStructureForC
1
0
Fork 0
mirror of https://github.com/by777/dataStructureForC.git synced 2026-03-20 12:05:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

KMP完善

Browse Source
This commit is contained in:
Xu Bai
2019-07-08 22:53:30 +08:00
parent bf6c1046a4
commit 3fc7def6f0
3 changed files with 75 additions and 337 deletions
Download Patch File Download Diff File Expand all files Collapse all files

262
_03.串/02模式匹配_KMP.c
View File

@@ -1,262 +0,0 @@
#include "string.h"
#include "stdio.h"
#include "stdlib.h"
#include "io.h"
#include "math.h"
#include "time.h"
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 100 /* 存储空间初始分配量 */
typedef int Status; /* Status是函数的类型,其值是函数结果状态代码，如OK等 */
typedef int ElemType; /* ElemType类型根据实际情况而定，这里假设为int */
typedef char String[MAXSIZE + 1]; /* 0号单元存放串的长度 */
/* 生成一个其值等于chars的串T */
Status StrAssign(String T, char *chars)
{
int i;
if (strlen(chars) > MAXSIZE)
return ERROR;
else
{
T[0] = strlen(chars);
for (i = 1; i <= T[0]; i++)
T[i] = *(chars + i - 1);
return OK;
}
}
Status ClearString(String S)
{
S[0] = 0; /* 令串长为零 */
return OK;
}
/* 输出字符串T。 */
void StrPrint(String T)
{
int i;
for (i = 1; i <= T[0]; i++)
printf("%c", T[i]);
printf("\n");
}
/* 输出Next数组值。 */
void NextPrint(int next[], int length)
{
int i;
for (i = 1; i <= length; i++)
printf("%d", next[i]);
printf("\n");
}
/* 返回串的元素个数 */
int StrLength(String S)
{
return S[0];
}
/* 朴素的模式匹配法 */
int Index(String S, String T, int pos)
{
int i = pos; /* i用于主串S中当前位置下标值，若pos不为1，则从pos位置开始匹配 */
int j = 1; /* j用于子串T中当前位置下标值 */
while (i <= S[0] && j <= T[0]) /* 若i小于S的长度并且j小于T的长度时，循环继续 */
{
if (S[i] == T[j]) /* 两字母相等则继续 */
{
++i;
++j;
}
else /* 指针后退重新开始匹配 */
{
i = i - j + 2; /* i退回到上次匹配首位的下一位 */
j = 1; /* j退回到子串T的首位 */
}
}
if (j > T[0])
return i - T[0];
else
return 0;
}
/* 通过计算返回子串T的next数组。 */
void get_next(String T, int *next)
{
int i, j;
i = 1;
j = 0;
next[1] = 0;
while (i < T[0]) /* 此处T[0]表示串T的长度 */
{
if (j == 0 || T[i] == T[j]) /* T[i]表示后缀的单个字符，T[j]表示前缀的单个字符 */
{
++i;
++j;
next[i] = j;
}
else
j = next[j]; /* 若字符不相同，则j值回溯 */
}
}
/* 返回子串T在主串S中第pos个字符之后的位置。若不存在，则函数返回值为0。 */
/* T非空，1≤pos≤StrLength(S)。 */
int Index_KMP(String S, String T, int pos)
{
int i = pos; /* i用于主串S中当前位置下标值，若pos不为1，则从pos位置开始匹配 */
int j = 1; /* j用于子串T中当前位置下标值 */
int next[255]; /* 定义一next数组 */
get_next(T, next); /* 对串T作分析，得到next数组 */
while (i <= S[0] && j <= T[0]) /* 若i小于S的长度并且j小于T的长度时，循环继续 */
{
if (j == 0 || S[i] == T[j]) /* 两字母相等则继续，与朴素算法增加了j=0判断 */
{
++i;
++j;
}
else /* 指针后退重新开始匹配 */
j = next[j]; /* j退回合适的位置，i值不变 */
}
if (j > T[0])
return i - T[0];
else
return 0;
}
/* 求模式串T的next函数修正值并存入数组nextval */
void get_nextval(String T, int *nextval)
{
int i, j;
i = 1;
j = 0;
nextval[1] = 0;
while (i < T[0]) /* 此处T[0]表示串T的长度 */
{
if (j == 0 || T[i] == T[j]) /* T[i]表示后缀的单个字符，T[j]表示前缀的单个字符 */
{
++i;
++j;
if (T[i] != T[j]) /* 若当前字符与前缀字符不同 */
nextval[i] = j; /* 则当前的j为nextval在i位置的值 */
else
nextval[i] = nextval[j]; /* 如果与前缀字符相同，则将前缀字符的 */
/* nextval值赋值给nextval在i位置的值 */
}
else
j = nextval[j]; /* 若字符不相同，则j值回溯 */
}
}
int Index_KMP1(String S, String T, int pos)
{
int i = pos; /* i用于主串S中当前位置下标值，若pos不为1，则从pos位置开始匹配 */
int j = 1; /* j用于子串T中当前位置下标值 */
int next[255]; /* 定义一next数组 */
get_nextval(T, next); /* 对串T作分析，得到next数组 */
while (i <= S[0] && j <= T[0]) /* 若i小于S的长度并且j小于T的长度时，循环继续 */
{
if (j == 0 || S[i] == T[j]) /* 两字母相等则继续，与朴素算法增加了j=0判断 */
{
++i;
++j;
}
else /* 指针后退重新开始匹配 */
j = next[j]; /* j退回合适的位置，i值不变 */
}
if (j > T[0])
return i - T[0];
else
return 0;
}
int main()
{
int i, *p;
String s1, s2;
StrAssign(s1, "abcdex");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("\n");
StrAssign(s1, "abcabx");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("\n");
StrAssign(s1, "ababaaaba");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("\n");
StrAssign(s1, "aaaaaaaab");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("\n");
StrAssign(s1, "ababaaaba");
printf(" 子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf(" Next为: ");
NextPrint(p, StrLength(s1));
get_nextval(s1, p);
printf("NextVal为: ");
NextPrint(p, StrLength(s1));
printf("\n");
StrAssign(s1, "aaaaaaaab");
printf(" 子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf(" Next为: ");
NextPrint(p, StrLength(s1));
get_nextval(s1, p);
printf("NextVal为: ");
NextPrint(p, StrLength(s1));
printf("\n");
StrAssign(s1, "00000000000000000000000000000000000000000000000001");
printf("主串为: ");
StrPrint(s1);
StrAssign(s2, "0000000001");
printf("子串为: ");
StrPrint(s2);
printf("\n");
printf("主串和子串在第%d个字符处首次匹配（朴素模式匹配算法）\n", Index(s1, s2, 1));
printf("主串和子串在第%d个字符处首次匹配（KMP算法） \n", Index_KMP(s1, s2, 1));
printf("主串和子串在第%d个字符处首次匹配（KMP改良算法） \n", Index_KMP1(s1, s2, 1));
return 0;
}

150
_03.串/_b.KMP.c
View File

@@ -2,7 +2,7 @@
* @Author: Xu Bai
* @Date: 2019-07-08 21:43:47
* @LastEditors: Xu Bai
* @LastEditTime: 2019-07-08 22:48:27
* @LastEditTime: 2019-07-08 22:53:07
*/
#include "stdio.h"
#include "stdlib.h"
@@ -133,7 +133,7 @@ int IndexByKMP(String S, String T, int pos)
GetNext(T, next);
while (i <= S[0] && j <= T[0])
{
if (j == 0 || S[i] = T[i])
if (j == 0 || S[i] == T[i])
{
++i;
++j;
@@ -186,7 +186,7 @@ void GetNextVal(String T, int *NextVal)
}
}
int IndexByKMP2(String S, String T, int pos)
int IndexByKMP1(String S, String T, int pos)
{
/*i用来主串S当前位置下标值 */
int i = pos;
@@ -219,86 +219,86 @@ int IndexByKMP2(String S, String T, int pos)
int main()
{
int i, *p;
String s1, s2;
int i, *p;
String s1, s2;
StrAssign(s1, "abcdex");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "abcdex");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
GetNext(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "abcabx");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "abcabx");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
GetNext(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "ababaaaba");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "ababaaaba");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
GetNext(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "aaaaaaaab");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "aaaaaaaab");
printf("子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
GetNext(s1, p);
printf("Next为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "ababaaaba");
printf(" 子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf(" Next为: ");
NextPrint(p, StrLength(s1));
get_nextval(s1, p);
printf("NextVal为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "ababaaaba");
printf(" 子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
GetNext(s1, p);
printf(" Next为: ");
NextPrint(p, StrLength(s1));
GetNextVal(s1, p);
printf("NextVal为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
StrAssign(s1, "aaaaaaaab");
printf(" 子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
get_next(s1, p);
printf(" Next为: ");
NextPrint(p, StrLength(s1));
get_nextval(s1, p);
printf("NextVal为: ");
NextPrint(p, StrLength(s1));
StrAssign(s1, "aaaaaaaab");
printf(" 子串为: ");
StrPrint(s1);
i = StrLength(s1);
p = (int *)malloc((i + 1) * sizeof(int));
GetNext(s1, p);
printf(" Next为: ");
NextPrint(p, StrLength(s1));
GetNextVal(s1, p);
printf("NextVal为: ");
NextPrint(p, StrLength(s1));
printf("--------------------------------\n");
printf("--------------------------------\n");
StrAssign(s1, "00000000000000000000000000000000000000000000000001");
printf("主串为: ");
StrPrint(s1);
StrAssign(s2, "0000000001");
printf("子串为: ");
StrPrint(s2);
printf("--------------------------------\n");
printf("主串和子串在第%d个字符处首次匹配（朴素模式匹配算法）\n", Index(s1, s2, 1));
printf("主串和子串在第%d个字符处首次匹配（KMP算法） \n", Index_KMP(s1, s2, 1));
printf("主串和子串在第%d个字符处首次匹配（KMP改良算法） \n", Index_KMP1(s1, s2, 1));
StrAssign(s1, "00000000000000000000000000000000000000000000000001");
printf("主串为: ");
StrPrint(s1);
StrAssign(s2, "0000000001");
printf("子串为: ");
StrPrint(s2);
printf("--------------------------------\n");
printf("主串和子串在第%d个字符处首次匹配（朴素模式匹配算法）\n", Index(s1, s2, 1));
printf("主串和子串在第%d个字符处首次匹配（KMP算法） \n", IndexByKMP(s1, s2, 1));
printf("主串和子串在第%d个字符处首次匹配（KMP改良算法） \n", IndexByKMP1(s1, s2, 1));
getchar();
return OK;

BIN
a.out
View File

Binary file not shown.