1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
|
void extend(char *s, int len, int i, int j, int *lo, int *hi)
{
while(i >= 0 && i < len && s[i] == s[j]) {
i--;
j++;
}
if(j - i > *hi - *lo) {
*lo = i;
*hi = j;
}
}
char* longestPalindrome(char* s) {
int *lo, *hi;
int len = strlen(s);
lo = malloc(sizeof(int));
hi = malloc(sizeof(int));
*lo = *hi = 0;
if(len < 2)
return s;
for(int i = 0; i < len - 1; i++) {
extend(s, len, i, i, lo, hi);
extend(s, len, i, i + 1, lo, hi);
}
*(s + (*hi)) = '\0';
return s + *lo + 1;
}
|
