数据结构与算法

• 一、思路
• 二、代码实现

#include 
#include 


typedef struct String {
    char* data;
    int len;
} String;
//初始化字符串，返回一个字符串
String* initString() {
    String* s = (String*)malloc(sizeof(String));
    s->data = NULL;
    s->len = 0;
    return s;
}

//把data传入字符串s中
void stringAssign(String* s, char* data) {
    if (s->data) {
        free(s->data);
    }
    int len = 0;
    char* temp = data;
    while (*temp) {
        len++;
        temp++;
    }
    if (len == 0) {
        s->data = NULL;
        s->len = 0;
    } else {
        temp = data;
        s->len = len;
        s->data = (char*)malloc(sizeof(char) * (len + 1));
        for (int i = 0; i < len; i++, temp++) {
            s->data[i] = *temp;
        }
    }
}

//打印遍历字符串
void printString(String* s) {
    for (int i = 0; i < s->len; i++) {
        printf(i == 0 ? "%c " : "-> %c ", s->data[i]);
    }
    printf("n");
}

//暴力匹配
void forceMatch(String* master, String* sub) {
    int i = 0;
    int j = 0;
    while (i < master->len && j < sub->len) {
        if (master->data[i] == sub->data[j]) {
            i++;
            j++;
        } else {
            i = i - j + 1;
            j = 0;
        }
    }
    if (j == sub->len) {
        printf("force match success.n");
    } else {
        printf("force match fail.n");
    }
}


int main(int argc, char* argv[]) {
    String* s = initString();
    String* s1 = initString();
    stringAssign(s, "aabaabaaf");
    stringAssign(s1, "aabaaf");
    printString(s);
    printString(s1);
    forceMatch(s, s1);
    return 0;
}

执行结果：

个人学习笔记，如有错误，还请指正
感谢各位的阅读。