kmp算法复习

纵浪大化中，喜，惧

于 2022-07-17 22:18:44 发布

阅读量109

点赞数

CC 4.0 BY-SA版权

分类专栏：暑期复习文章标签：算法数据结构 c++

本文链接：https://blog.csdn.net/beyondzty/article/details/125838165

暑期复习专栏收录该内容

3 篇文章

订阅专栏

在这里插入图片描述

leetcode题目
https://leetcode.cn/problems/implement-strstr/

#include <stdlib.h>
#include<stack>
#include<queue>
#include<iostream>
#include<string>
#include<map>
#include<unordered_map>
#include<vector>
#include <math.h>
using namespace std;
class Solution {
public:
    vector<int>match;
    int strStr(string haystack, string needle) {
        if (needle.length() == 0)
        {
            return 0;
        }
        else
        {
            buildmatch(needle);
            int i = 0; int j = 0;
            while (i != haystack.length() && j != needle.length())
            {
                if (haystack[i] == needle[j])
                {
                    ++i; ++j;
                }
                else
                {
                    if (j >= 1)
                    {
                        j = match[j - 1] + 1;
                    }
                    else
                    {
                        ++i;
                    }
                }
            }
            return j == needle.length() ? i - j : -1;
        }
    }
    void buildmatch(string needle)
    {
        match.resize(needle.size());
        match[0] = -1;
        for (int j = 1; j < needle.length(); j++)
        {
            int i = match[j - 1];
            while (i >= 0 && needle[i + 1] != needle[j])
            {
                i = match[i];
            }
            if (needle[i + 1] == needle[j])
            {
                match[j] = i + 1;
            }
            else
            {
                match[j] = -1;
            }
        }

    }
};