求两个字符串公共子串的最长长度

#include<iostream>
#include"string"
using namespace std;

void main()
{
while (true)
{
string str1,str2;//定义两个string变量
cin>>str1;
cin>>str2;
string max,min;
//交换最长最短字符串
if (str1.size()<str2.size())
{
max = str2;
min = str1;
}else
{
max = str1;
min = str2;
}
int res[100] = {0};//存储结果
int index = 0;
for (int i = 0; i < max.size(); i++)
{
int nums = 0;
for (int j = 0; j < min.size(); j++)
{
while(max[i]==min[j]&&i<max.size()&&j<min.size())
{
i++;
j++;
nums++;
}
}
res[index] = nums;
index++;
}
int bigest = 0;
for (int i = 0; i < index; i++)
{
if (res[i]>bigest)
bigest = res[i];
}
cout<<"公共字符串中最长长度为："<<bigest;
}
}