问题:
输入一个字符串,判断它是否为回文以及镜像串。输入字符串保证不含数字0.所谓回文串,就是反转之后原串相同,如abba和madam。所谓镜像串,就是左右镜像之后和原串相同,如2S和3AIAE。注意,并不是每个字符在镜像之后都能得到一个合法字符,本题中,每个字符的镜像如下所示,(空白项表示该字符镜像后不能得到一个合法的字符)。
样例输出:
NOTAPALINDROME – is not a palindrome.
ISAPALINILAPASI – is a regular palindrome.
2A3MEAS – is a mirrored string.
ATOYOTA – is a mirrored palindrome
解决:
#include<stdio.h>
#include<string.h>
#include<ctype.h> // isalpha()
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']; //字母
else return rev[ch-'0'+25]; // 数字
}
int main() {
char s[30];
int i = 0;
while((scanf("%s", s)) == 1) {
int len = strlen(s);
int p = 1, m = 1;
for(i = 0; i < len/2; ++i) {
if(s[i] != s[len-i-1]) p = 0;//回文数
if(r(s[i]) != s[len-i-1]) m = 0;//镜像数
}
printf("%s -- is %s.\n\n", s, msg[2*m+p]);
}
return 0;
}