69,373
社区成员
发帖
与我相关
我的任务
分享
#include<stdio.h>
char* longestPalindrome(char* s) {
char substring[100] = { 0 };
int i, j, k, temp;
if (s[0] == '\0')
return substring;
else
{
for (i = 0; s[i] != '\0'; i++)
{
for (j = i + 1; s[j] != '\0'; j++)
if (s[i] == s[j])
break;
if (s[i] == s[j])
break;
}
temp = 0;
for (k = i; k <= j; k++)
{
substring[temp] = s[k];
temp++;
}
return substring;
}
}
void main()
{
char *p1;
char *p = "abab";
p1=longestPalindrome(p);
printf("%c%c%c", p1[0], p1[1], p1[2]);
printf("%s",p1);
getchar();
}