BF KMP以及改进后的KMP

推荐大家看着三篇博客

https://blog.csdn.net/v_july_v/article/details/7041827

https://www.cnblogs.com/yjiyjige/p/3263858.html

https://www.cnblogs.com/tangzhengyue/p/4315393.html

BF

#include <iostream>
#include <cstring>
#define maxn 50

using namespace std;

int main()
{
    int i = 0,j = 0;
    char s[maxn];
    char p[maxn];
    cin >> s >> p;
    int lenS = strlen(s);
    int lenP = strlen(p);
    while(i < lenS&&j < lenP)
    {
        if(s[i] == p[j])
        {
            i++;
            j++;
        }
        else
        {
            i = i - j + 1;
            j = 0;
        }
    }
    if(j == lenP)
    {
        cout << i - j;
    }
    else
    {
        cout << -1;
    }
    return 0;
}

KMP

#include <iostream>
#include <cstring>
#define maxn 50

int Next[maxn];

void findNext(char p[maxn]);

using namespace std;



int main()
{
    int i = 0,j = 0;
    char s[maxn];
    char p[maxn];
    cin >> s >> p;
    int lenS = strlen(s);
    int lenP = strlen(p);
    findNext(p);
    while(i < lenS&&j < lenP)
    {
        if(j == -1||s[i] == p[j])
        {
            i++;
            j++;
        }
        else
        {
            //记住i不用回溯了！
            j = Next[j];
        }
    }
    if(j == lenP)
    {
        cout << i - j << endl;
    }
    else
    {
        cout << -1 << endl;
    }
    return 0;
}
void findNext(char p[maxn])
{
	int lenP = strlen(p);
	Next[0] = -1;
	int k = -1;
	int j = 0;
    while(j < lenP)
    {
        if(k == -1||p[k] == p[j])
        {
            Next[++j] = ++k;
        }
        else
        {
            k = Next[k];
        }
    }
}

改进后的KMP

#include <iostream>
#include <cstring>
#define maxn 50

int Next[maxn];

void findNext(char p[maxn]);

using namespace std;



int main()
{
    int i = 0,j = 0;
    char s[maxn];
    char p[maxn];
    cin >> s >> p;
    int lenS = strlen(s);
    int lenP = strlen(p);
    findNext(p);
    while(i < lenS&&j < lenP)
    {
        if(j == -1||s[i] == p[j])
        {
            i++;
            j++;
        }
        else
        {
            j = Next[j];
        }
    }
    if(j == lenP)
    {
        cout << i - j << endl;
    }
    else
    {
        cout << -1 << endl;
    }
    return 0;
}
void findNext(char p[maxn])
{
	int lenP = strlen(p);
	Next[0] = -1;
	int k = -1;
	int j = 0;
    while(j < lenP)
    {
        //如果p[k] == [[j]，很明显，我们的next[j+1]就直接等于k+1。用代码来写就是next[++j] = ++k;
        //可是我们知道，第j+1位是失配了的，如果我们回退j后，发现新的j(也就是此时的++k那位)跟回退之前的j也相等的话，必然也是失配。所以还得继续往前回退。
        if(k == -1||p[k] == p[j])
        {
            if(p[k + 1] == p[j + 1])
            {
                Next[++j] = Next[++k];
            }
            else
            {
                Next[++j] = ++k;
            }
        }
        else
        {
            k = Next[k];
        }
    }
}