String Matching KMP Learning

I would like to thank you for your excellent understanding of the KMP blog link. The blog skin style of the blog garden is hundreds of times better than that of CSDN.

#include 
 
  #include 
  
   using namespace std;int matcher(const char* s,const char* p){    int i=0;    int j=0;    while( s[i]!='\0' && p[j]!='\0'){        if(s[i]==p[j]){            i++;            j++;        }        else{            i=i+1-j;            j=0;        }    }    if(p[j]=='\0'){        return i-strlen(p);    }    else return -1;}void getNext(const char *p,int *next){    int i=0;    int j=-1;    int n=strlen(p);    next[0]=-1;    while(i