4.3

4.3 已知主串s=“cbaacbcacbcaacbcbc”,模式串t=“cbcaacbcbc”,求出t的next数组值和nextval数组值，并画出KMP算法。*

#include<iostream>
#define MaxSize 6
using namespace std;
int Next[MaxSize];
int Nextval[MaxSize];
void GetNext(string t){
    Next[0]=-1;
    int i=0,j=-1;
    int s=t.size();
    while(i<s){
        if(j==-1||t[i]==t[j]) Next[++i]=++j;
        else j=Next[j];
    }
    for(int i=0;i<s;i++) cout<<Next[i]<<" ";
    cout<<endl;
}
void GetNextval(string t){
    Nextval[0]=-1;
    int i=0,j=-1;
    int s=t.size();
    while(i<s){
        if(j==-1||t[i]==t[j]){
            i++,j++;
            if(t[i]!=t[j]) Nextval[i]=j;
            else Nextval[i]=Nextval[j];
        }
        else j=Nextval[j];
    }
    for(int i=0;i<s;i++) cout<<Nextval[i]<<" ";
}
int main()
{
    string t; cin>>t;
    GetNext(t);
    GetNextval(t);
    return 0;
}
//cbcaacbcbc
//-1 0 0 1 0 0 1 2 3 2 
//-1 0 -1 1 0 -1 0 -1 3 -1