字符串匹配之kmp算法

#include<iostream>
#include<stdio.h>
#include<string.h>
#define OK 1
#define OVERFLOW -2
#define ERROR 0
#define MAXSIZE 255
using namespace std;
typedef char SString[MAXSIZE + 1];
typedef int Status;
Status StrAssign(SString T,char *chars){
       int i;
       if(strlen(chars)>MAXSIZE)
          return ERROR;
      else{
          T[0]=strlen(chars);
//          cout<<T[0];
          for(i=1;i<=T[0];i++)
             T[i]=*(chars+i-1);
      }
    return OK;
}
void get_next(SString S,int next[]){
       int i=1,j=0;
       next[1]=0;
       while(i<S[0]){
           if(j==0||S[i]==S[j]){
               i++;
               j++;
			   next[i]=j;
           }
           else
              j=next[j];
       }
}
Status Index_KMP(SString S,SString T,int num,int next[]){
      int i=num,j=1;
      while(i<=S[0]&&j<=T[0]){
           if(j==0||S[i]==T[j]){
               i++;
               j++;
//               next[i]=i;
           }
           else
              j=next[j];
      }
      if(j>T[0])
         return i-T[0];
      else
         return 0;
}
int main(){
      SString S;
      SString Q;
      SString R;
      SString T;
      cout<<"请输入一个字符串作为主串："<<endl;
      cin>>Q;
      StrAssign(S,Q);
      cout<<"请输入一个串作为子串："<<endl;
      cin>>R;
      StrAssign(T,R);
      int *p=new int[T[0]+1];
      get_next(T,p);
      cout<<"主串和子串在第"<<Index_KMP(S,T,1,p)<<"处匹配"<<endl;
     return 0;
}