数算 3

struct SeqSting{
int MAXNUM;
int n;
char *c;
};
typedef struct SeqString *PSeqString;

struct StrNode;
typedef strct StrNode *PStrNode;
struct StrNode{
char c;
PStrNode link;
};
typedef struct StrNode *LinkStrNode;

makeNext(PSeqString p, int *next){
int i=0, k=-1;
next[0]=-1;
while (i<p->n-1){
while (k>=0&&p->c[i]!=p->c[k])
k=next[k];
i++;
k++;
next[i]=k;
}
}

makeNext (PSeqString p, int *next){
int i=0, k=-1;
next[0]=-1;
while (i<p->n-1){
while (k>=0 && p->c[i]!=p->c[k])
i++;k++;
if (p->c[i]==p->c[k]) next[i]=next[k];
else next[i]=k;
}
}