void max_str(char* s)
{
int i, j,len, len1,index;
char buf[10] = { 0 };
i = 0, len =0, index = 0;
while (i < strlen(s) - 1) //遍历整个字符串对每个字符形成的子串进行比较
{
j = i + 1; //从i的下个位置开始查找
while (j < strlen(s) - 1) //遍历从j到串尾
{
len1 = 1;
if (s[i] == s[j])
{
for (int k = 1; s[i + k] == s[j + k]; k++) //查找子串
len1++;
if (len1 > len)
{
len = len1;
index = i;
}
j += len;
}
else
j++;
}
i++;
}
i = 0;
while (len > 0)
{
buf[i] = s[index + i];
i++;
len--;
}
buf[++i] = '\0';
printf("%s\n", buf);
}