原串为S,第一个字串为S1,从头开始,另一个字串S2与S1向右错位平移1位、2位、3位……与S1匹配,找公共字串,并用maxlen记录已找到的最大长度,懂了这个就很简单了,这题也不难
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define ok 1
#define error 0
#define true 1
#define false 0
#define overflow -1
using namespace std;
typedef int status;
#define maxsize 255
typedef char sstring[maxsize+1];
status strassign(sstring &s,char *ch)
{
int i=0;
char *p=ch;
while(i<maxsize&&*p)s[++i]=*p++;
s[0]=i;
if(*p)return error;
else return ok;
}
void strcpy(sstring &t,sstring s)
{
int i;
for(i=0; i<=s[0]; i++)
t[i]=s[i];
}
int strcompare(sstring s,sstring t)
{
int i=1;
while(i<=s[0]&&i<=t[0]&&s[i]==t[i])i++;
if(i<=s[0])
if(i<=t[0])return s[i]-t[i];
else return s[i];
else if(i<=t[0])return -t[i];
else return 0;
}
status concat(sstring &t,sstring s1,sstring s2)
{
int i,j;
for(i=1; i<=s1[0]; i++)t[i]=s1[i];
if(s1[0]+s2[0]<=maxsize)
{
for(j=1; j<=s2[0]; j++)t[i++]=s2[j];
t[0]=s1[0]+s2[0];
return ok;
}
else
{
for(j=1; j<=maxsize-s1[0]; j++)t[i++]=s2[j];
t[0]=maxsize;
return error;
}
}
status substring(sstring &sub,sstring s,int pos, int len)
{
int i;
if(pos<1||pos>s[0]||len<0||len>s[0]-pos+1)
return error;
for(i=1; i<=len; i++)sub[i]=s[pos+i-1];
sub[0]=len;
return ok;
}
void putdata(sstring s)
{
int i;
printf("\n");
for(i=1; i<=s[0]; i++)
printf("%c",s[i]);
}
/*4.30*/
void get_maxsub(sstring s)
{
int maxlen=0,i,j,k,l;
int pos1,pos2;
for(i=1;i<=s[0];i++) /*S1向右移位i位*/
{
for(k=0,j=1;j<=s[0]-i;j++) /*j跟着S1移动,j+i跟着S2移动,j+i小于或等于S的最大长度,即s[0]*/
{
if(s[j]==s[j+i])
k++;
else
k=0;
if(k>maxlen)
{
pos1=j-k+1; /*移到了j点,则S1起始位置减去公共字串的最大长度再+1*/
pos2=pos1+i;
maxlen=k;
}
}
}
if(maxlen>0)
{
printf("最长的公共字串为:\n");
l=pos1;
for(i=1;i<=maxlen;i++)
{
printf("%c",s[l++]);
}
printf("\n长度为:%d",maxlen);
printf("\n第一个字串起始位置:%d,第二个字串起始位置为:%d",pos1,pos2);
}
else
printf("没有公共字串!\n");
}
int main()
{
sstring a;
strassign(a,"abcdabcdabcd");
printf("原串为:");
putdata(a);
printf("\n");
get_maxsub(a);
return 0;
}