c语言最大子字符串,两字符串最大子串?

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

#include

#include

int GetFirstPos(char *s1,char *s2)

{&nbsp

&nbsp &nbsp

&nbsp &nbsp int len1=strlen(s1),len2=strlen(s2);

&nbsp &nbsp for(int i=0; i

&nbsp &nbsp {

&nbsp &nbsp &nbsp &nbsp for(int j=0; j

&nbsp &nbsp &nbsp &nbsp {

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp if(s1[i]==s2[j])&nbsp &nbsp &nbsp &nbsp

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp return i;

&nbsp &nbsp &nbsp &nbsp }

&nbsp &nbsp }

&nbsp &nbsp

}

char* GetCommon(char *s1, char *s2)

{

&nbsp &nbsp

&nbsp &nbsp int len1=strlen(s1);

&nbsp &nbsp int len2=strlen(s2);

&nbsp &nbsp int maxlen=0;

&nbsp &nbsp int as,bs,count;

&nbsp &nbsp char *s=NULL;

&nbsp &nbsp for(int i=0; i

&nbsp &nbsp {

&nbsp &nbsp &nbsp &nbsp for(int j=0; j

&nbsp &nbsp &nbsp &nbsp {

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp if(s1[i]==s2[j])&nbsp &nbsp &nbsp &nbsp //找到了第一个相等的

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp {

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp as=i;

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp bs=j;

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp count=1; // 保存第一个相等的首地址

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp }

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp while(as+1

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp count++;

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp if(count>maxlen)&nbsp //如果大于最大长度则更新

&nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp &nbsp maxlen=count;

&nbsp &nbsp &nbsp &nbsp }

&nbsp &nbsp }

&nbsp &nbsp s=new char[maxlen+1];

&nbsp &nbsp s[maxlen]=0;

&nbsp &nbsp s=s1+GetFirstPos(s1,s2);

&nbsp &nbsp for(i=0; i

&nbsp &nbsp s[i]=s1[GetFirstPos(s1,s2)+i];

&nbsp &nbsp return s;

}

运行后程序崩溃,期待高手.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值