找出两个字符串中最大公共子字符串

#include <iostream>
#include <string.h>
using namespace std;
int count;

char *s1="abccade";

char *s2="dgcadde";
void GetCommon(char *s1, char *s2, char **r1, char **r2,char **p)//*r1用于返回指向两个共同字符串在s1中的起始位置，*r2同理，*p指向最后的共同字符串
{
int len1 = strlen(s1);
int len2 = strlen(s2);
int maxlen = 0;
for(int i = 0; i < len1; i++)
 {
    for(int j = 0; j < len2; j++)
    {
    if(s1[i] == s2[j])
        {
    int as = i, bs = j, count = 1;
    while(as + 1 < len1 && bs + 1 < len2 && s1[++as] == s2[++bs])//有多个相同的字符
    count++;
        if(count > maxlen)
            {
            maxlen = count;
            *r1 = s1 + i;
            *r2 = s2 + j;
            *p=new char[count+1];//在堆heap区开辟空间，最后一字节存放'\0'字符串结束标志
            memcpy(*p,s1+i,count);
            *(*p+count)='\0';
            }
        }
    }
  }
}
int main()
{
    char *str1,*str2,*str3;
    GetCommon(s1,s2,&str1,&str2,&str3);
    cout<<str1<<endl<<str2<<endl<<str3<<endl;
    delete[] str3;//多个字符空间
    cout << "Hello world!" << endl;
    return 0;
}