typedef struct String {
char* data;
int len;
}String;
String* initString() {
String* s = (String*)malloc(sizeof(String));
s->data = NULL;
s->len = 0;
return s;
}
void AssignString(String* s, char* c) {
if (s->data)
free(s->data);
//确定data长度
char* temp = c;
int len = 0;
while (*temp) {//若temp所指的不为空字符
len++;
temp++;
}
if (len == 0) {
s->len = 0;
s->data = NULL;
}
else {
s->data = (char*)malloc(sizeof(char) * (len + 1));
temp = c;
for (int i = 0; i < len; i++) {
s->data[i] = *temp;
temp++;
}
s->len = len;
}
}
int* getnext(String* s) {
int* next = (int*)malloc(sizeof(int) * s->len);
int i = 0;
int j = -1;
next[0] = 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;
}
void printNext(int* next, int len) {
for (int i = 0; i < len; i++) {
printf(i == 0 ? "%d" : "->%d", next[i] + 1);
}
printf("\n");
}
void printString(String* s) {
for (int i = 0; i < s->len; i++) {
printf(i == 0 ? "%c" : "-> %c", s->data[i]);
}
printf("\n");
}
void skmmatch(String* master, String* sub, int* next) {
int i = 0;
int j = 0;
while (i < master->len && j < sub->len) {
//若没有加上j = -1,可能会导致死循环
if (j= -1 ||master->data[i] == sub->data[j]) {
i++;
j++;
}
else
j = next[j];
}
if (j == sub->len)
printf("kmp match success.\n");
else
printf("kmp match fail.\n");
}
int main() {
String* s1 = initString();
String* s2 = initString();
AssignString(s1, "ababaababc");
AssignString(s2, "abc");
int* next = getnext(s2);
printString(s1);
printString(s2);
printNext(next, s2->len);
skmmatch(s1, s2,next);
}
#include "headfile.h"
typedef struct String {
char* data;
int len;
}String;
String* initString() {
String* s = (String*)malloc(sizeof(String));
s->data = NULL;
s->len = 0;
return s;
}
void AssignString(String* s, char* c) {
if (s->data)
free(s->data);
//确定data长度
char* temp = c;
int len = 0;
while (*temp) {//若temp所指的不为空字符
len++;
temp++;
}
if (len == 0) {
s->len = 0;
s->data = NULL;
}
else {
s->data = (char*)malloc(sizeof(char) * (len + 1));
temp = c;
for (int i = 0; i < len; i++) {
s->data[i] = *temp;
temp++;
}
s->len = len;
}
}
int* getnext(String* s) {
int* next = (int*)malloc(sizeof(int) * s->len);
int i = 0;
int j = -1;
next[0] = 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;
}
void printNext(int* next, int len) {
for (int i = 0; i < len; i++) {
printf(i == 0 ? "%d" : "->%d", next[i] + 1);
}
printf("\n");
}
void printString(String* s) {
for (int i = 0; i < s->len; i++) {
printf(i == 0 ? "%c" : "-> %c", s->data[i]);
}
printf("\n");
}
void skmmatch(String* master, String* sub, int* next) {
int i = 0;
int j = 0;
while (i < master->len && j < sub->len) {
//若没有加上j = -1,可能会导致死循环
if (j= -1 ||master->data[i] == sub->data[j]) {
i++;
j++;
}
else
j = next[j];
}
if (j == sub->len)
printf("kmp match success.\n");
else
printf("kmp match fail.\n");
}
int main() {
String* s1 = initString();
String* s2 = initString();
AssignString(s1, "ababaababc");
AssignString(s2, "abc");
int* next = getnext(s2);
printString(s1);
printString(s2);
printNext(next, s2->len);
skmmatch(s1, s2,next);
}