妙趣横生算法 4：判断字符串是否回文

实例说明

实例解析

程序代码

#include <stdio.h>
#define MAX 50
int cycle(char *s)
{
char *h,*t;
for(h=s,t=s+strlen(s)-1;t>h;h++,t--)
{
if(*h!=*t)
{
break;
}
}
return t<=h;
}
main()
{
char s[MAX];
while(1)
{
printf("Please input the string you want to judge(input ^ to quit):");
scanf("%s",s);
if(s[0]=='^')
{
break;
}
if(cycle(s))
{
printf("%s is a cycle string.\n",s);
}
else
{
printf("%s is not a cycle string.\n",s);
}
}
printf("\n Thank you for your using,bye bye!\n");
}

个人总结

主要运用指针的强大----可操控性

第一步：两个指针分别指向一头一尾





 

第二步：移动指针，比较字符