kmp字符匹配
相较于字符串暴力匹配,kmp字符匹配思想为,一旦不匹配了,主串下标不懂,子串下标更新为next数组中相应下标的值。子串对应的next数组下标为i的值为子串中第i个字符前的字符子串公共前后缀大小。
#include <stdio.h>
#include <stdlib.h>//开辟空间需包含此头文件
//定义字符串结构体,包含一个字符指针和字符串长度
typedef struct myString {
char* data;
int len;
}myString;
//初始化字符串
myString* initMyString() {
myString* s = (myString*)malloc(sizeof(myString));
s->data = NULL;
s->len = 0;
return s;
}
//赋值字符串
void myStringAssign(myString* s, char* data) {
if (s->data) {
free(s->data);
s->data = NULL;
}
char* temp = data;
int len = 0;
while (*temp) {
len++;
temp++;
}
s->len = len;
temp = data;
s->data = (char*)malloc(sizeof(char)*(len + 1));
for (int i = 0; i < len; i++) {
s->data[i] = *temp;
temp++;
}
}
//遍历打印字符串
void printMyString(myString* s) {
for (int i = 0; i < s->len; i++) {
printf("%c ", s->data[i]);
}
printf("\n");
}
//求next数组函数
int* getNext(myString* s) {
int i = 0;
int j = -1;
int* next = (int*)malloc(sizeof(int) * s->len);
next[i] = j;
while (i < s->len - 1) {
if (j == -1 || s->data[i] == s->data[j]) {
i++;
j++;
next[i] = j;
}
else {
j = next[j];
}
}
return next;
}
//打印next数组
void printNext(int* next,myString* s) {
for (int i = 0; i < s->len; i++) {
printf("%d ", next[i]);
}
printf("\n");
}
//kmp字符匹配函数
void kmp(myString* master, myString* sub, int* next) {
int i = 0;
int j = 0;
while (i < master->len&&j < sub->len) {
if (j == -1||master->data[i] == sub->data[j]) {
i++;
j++;
if (j == sub->len) {
printf("success\n");
return;
}
}
else {
j = next[j];
}
}
printf("fail\n");
}
//测试函数
void test() {
myString* master = initMyString();
myStringAssign(master, "abacabab");
printMyString(master);
myString* sub1 = initMyString();
myStringAssign(sub1, "abab");
printMyString(sub1);
int* next1 = getNext(sub1);
printNext(next1, sub1);
myString* sub2 = initMyString();
myStringAssign(sub2, "abad");
printMyString(sub2);
int* next2 = getNext(sub2);
printNext(next2, sub2);
kmp(master, sub1, next1);
kmp(master, sub2, next2);
}
int main() {
test();
return 0;
}