[字符串]寻找一个字符串中最大的公共子串

//比较两个字符串大小
bool compareSub(char* const s1,char* const s2)
{
    int i=0;
    while((i<strlen(s1))&&(i<strlen(s2)))
    {
        if(toupper(s1[i])<toupper(s2[i]))
            return true;
        else if(toupper(s1[i])>toupper(s2[i]))
            return false;
        ++i;
    }
    return strlen(s1)>strlen(s2);
}

//比照两个字符串的公共子串
int commonSub(char* s1,char* s2,char* comChar)
{
    int i=0;
    while((i<strlen(s1))&&(i<strlen(s2)))
    {
        if(toupper(s1[i])==toupper(s2[i]))
        {
            comChar[i]=s1[i];
            ++i;
        }
        else
            break;
    }
    comChar[i]='';
    return i;
}
//获得最长公共子串
int getLongestSub(char* c,char* subChar)
{
vector<char*> subVector;
//获得子串
for(int i=0;i<strlen(c);i++)
{
    subVector.push_back(&c[i]);
}
//子串排序
sort(subVector.begin(),subVector.end(),compareSub);
//获得最长子串
const int n=strlen(c);
char* tempChar=new char[n];
int max=0;
for(int i=0;i<subVector.size()-1;i++)
{
    int temp=commonSub(subVector.at(i),subVector.at(i+1),tempChar);
    if(temp>max)
    {
        max=temp;
        strcpy(subChar,tempChar);
    }
}
delete[] tempChar;
return max;
}

//简单示范
int main()
{
//输入
char* c=new char[100];
cin.getline(c,100);
char* subChar=new char[100];
int max=0;
max=getLongestSub(c,subChar);
//输出
cout<<"biggest substring of <"<<c<<">"<<endl;
cout<<"length:"<<max<<" subString:"<<subChar<<endl;
delete[] subChar;
delete[] c;
system("pause");
}