计算两个字符串最大公共字串的长度，字符不区分大小写

#include
#include
using namespace std;
int Maxsubstr(string a,string b)
{
unsigned int s1,s2;
int count=0,Max=0;
for(unsigned int i=0;a[i]!=’\0’;++i)
{
for(unsigned int j=0;b[j]!=’\0’;++j)
{
s1=i; s2=j;
while(a[s1]==b[s2]&&s1<a.length() && s2<b.length())
{
s1++; s2++; count++;
}
if(count>Max)
{
Max=count;
}
count=0;
}
}
return Max;
}
int main()
{
string s1,s2;
cin>>s1;
cin>>s2;
for(unsigned int i=0;i<s1.length();++i)
{
s1[i]=tolower(s1[i]);
}
for(unsigned int i=0;i<s2.length();++i)
{
s2[i]=tolower(s2[i]);
}
cout<<Maxsubstr(s1,s2)<<endl;
return 0;
}