UVA401 - Palindromes

问题描述

输入一串字符串，判断它是否为回文串还是镜像串（根据要求改变后再翻转和原字符串相同）。

思路

代码

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const char* rev="A   3  HIL JM O   2TUVWXY51SE Z  8 "; const char* msg[]={"not a palindrome","a regular palindrome","a mirrored string","a mirrored palindrome"};
char r(char ch)
{
if(isalpha(ch))
return rev[ch-'A'];
return rev[ch-'0'+25];
}
int main()
{
char s[30];
while(cin>>s)
{
int len=strlen(s);
int p=1,m=1;
for(int i=0;i<(len+1)/2;i++)
{
if(s[i]!=s[len-i-1])   //不是回文串
p=0;
if(r(s[i])!=s[len-1-i])   //不是镜像串
m=0;
}
printf("%s -- is %s.\n\n",s,msg[m*2+p]);
}
return 0;
}