#include <stdio.h>
#include <iostream>
using namespace std;
int main()
{
char arr[] = {'m','n','a','n','m'};
char* pHead = arr;
char* pTail = arr + (sizeof(arr) / sizeof(arr[0]) - 1); //将指针移动到数组末尾
int flag = 1;
while (pHead < pTail)
{
if (*pHead != *pTail)
{
flag = 0;
break;
}
pHead++;
pTail--;
}
if (flag == 0)
{
printf("不是回文\n");
}
else
{
printf("是回文\n");
}
system("pause");
return 0;
}
判断是否是回文串
猜你喜欢
转载自blog.csdn.net/lpl312905509/article/details/93800852
今日推荐
周排行