int index(seqstring p, seqstring t) i int i,j, succ; i=0;suc=0;/*suc为匹配成功的标志* while((i<=t. length-p length+1)&&(!succ) j=0;suc=1;/用扫描模式p*/ while((<=plength-1)&& succ if (p str[j]==t str[i+j])j++ else succ=0. ++ if(succ)return(i-1); else return(-1);int index(seqstring p, seqstring t) { int i,j, succ; i=0; succ=0; /* succ为匹配成功的标志*/ while((i<=t.length-p.length+1) && (!succ)) { j=0 ; succ=1; /*用j扫描模式p*/ while ((j<=p.length-1) && succ) if (p.str[j]==t.str[i+j] ) j++; else succ=0; ++i; } if (succ) return (i-1); else return (-1); }