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
| bool isPalindrome(char * s){
char strss[500000];
int x=0,y=0;
while(x< strlen(s)){
if((s[x]>='a'&&s[x]<='z')||(s[x]>='0'&&s[x]<='9'))
strss[y]=s[x];
else if (s[x]>='A'&&s[x]<='Z')
strss[y]=s[x]+'a'-'A';
else {
x++;
continue;
}
y++;
x++;
}
strss[y]='\0';
if(strlen(strss)==0||strlen(strss)==1)
return 1;
int len=strlen(strss);
x=0;
while(strss[x] == strss[len-x-1]){
if(x==len/2)
return 1;
x++;
}
return 0;
}
|
