-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLongestPalindromicSubstring.c
70 lines (57 loc) · 2.41 KB
/
LongestPalindromicSubstring.c
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
char * longestPalindrome(char * s){
int max_i = 0;
int max_j = 0;
int max_len = 0;
char *buf = malloc(1024);
memset(buf, 0, 1024);
int i = 0;
for(i; s[i] != '\0'; i++){
/* 1 */
if(s[i + 1 ] == '\0')
break;
if( s[i] == s[i + 1] ){
int t_i = i;
int t_j = i + 1;
for(; t_i >= 0 && s[t_j] != '\0'; t_i--, t_j++){
if(s[t_i] != s[t_j])
break;
int len = t_j - t_i;
if(len > max_len){
max_i = t_i;
max_j = t_j;
max_len = len;
}
}
}
if(s[i + 2 ] == '\0')
break;
/* 2 */
if( s[ i ] == s[i + 2] ){
int t_i = i;
int t_j = i + 2;
for(; t_i >= 0 && s[t_j] != '\0'; t_i--, t_j++){
if(s[t_i] != s[t_j])
break;
int len = t_j - t_i;
if(len > max_len){
max_i = t_i;
max_j = t_j;
max_len = len;
}
}
}
}
memcpy(buf, &s[max_i], max_len + 1);
return buf;
}
int main()
{
char s[] = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabcaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa";
//char s[] = "cbbd";
int n = strlen(s);
printf(" n = %d, result = [%s]\n", n, longestPalindrome(s));
return 0;
}