串处理(朴素模式匹配/KMP模式匹配)

最新推荐文章于 2023-09-16 06:00:00 发布

zhangjie121

最新推荐文章于 2023-09-16 06:00:00 发布

阅读量467

点赞数

分类专栏：数据结构文章标签：串 KMP 模式匹配查找首次出现位置

本文链接：https://blog.csdn.net/zhangjie121/article/details/41211005

版权

数据结构专栏收录该内容

2 篇文章 0 订阅

订阅专栏

朴素模式匹配

//封装一个字符串
typedef struct String
{
    const char *string;
    unsigned long count;
}String, *StringPtr;

//查找函数
void FindLocation(StringPtr src/*主串*/, StringPtr tar/*子串*/, unsigned long *pos/*返回位置*/)
{
    unsigned long i = 0;
    unsigned long j = 0;
    
    while (i < src->count && j < tar->count)
    {
        if (src->string[i] == tar->string[j])
        {
            i++;
            j++;
        }
        else
        {
            j = 0;
            i = i - j + 1;
        }
    }
    if (j == tar->count)
    {
        (*pos) = i - j + 1;
    }
    else
    {
        (*pos) = 0;
    }
}

调用示例

int main(int argc, const char * argv[])
{
    StringPtr S = (StringPtr)malloc(sizeof(String));
    S->string = "abcdzhang";
    S->count = strlen(S->string);
    
    StringPtr s = (StringPtr)malloc(sizeof(String));
    s->string = "zhang";
    s->count = strlen(s->string);
    
    unsigned long *pos = (unsigned long *)malloc(sizeof(unsigned long));
    (*pos) = 0;
    FindLocation(S, s, pos);
    if ((*pos))
    {
        printf("location is %lu\n",*pos);
    }
    else
    {
        printf("not found!\n");
    }
    
    return 0;
}