最大公共子串

给定字符串A和B,输出A和B中的最大公共子串。
比如A=”aocdfe” B=”pmcdfa” 则输出”cdf”
*/

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
char *maxSub(char shortstring[], char longstring[])
{
int i, j;
char *substring=malloc(256);
if(strstr(longstring, shortstring)!=NULL)              //如果……，那么返回shortstring
return shortstring;
for(i=strlen(shortstring)-1;i>0; i--)                 //否则，开始循环计算
{
   for(j=0; j<=strlen(shortstring)-i; j++){
   memcpy(substring, &shortstring[j], i);
   substring[i]=’/0′;
   if(strstr(longstring, substring)!=NULL)
   return substring;
}
}
return NULL;
}

int main(int argc,char* argv[])
{
char *str1=""aocdfe;
char *str2="pmcdfa"
char *maxsubString=NULL;
if(strlen(str1)>strlen(str2))                         //将短的字符串放前面
maxsubString=maxSub(str2, str1);
else
maxsubString=maxSub(str1, str2);
printf(”the longest common string is: %s/n”, maxsubString);
}