回文词
问题描述
输入一个字符串,判断它是否为回文串及镜像串。输入字符串保证不含数字0。所谓回汶川,就是反转以后和原串相同,如aha和madam。所谓镜像串,就是左右镜像之后和原串相同,如2S和3AIAE。注意,并不是每个字符在镜像之后都能得到一个合法字符。在本题中,每个字符的景象如下表所示(空白项表示该字符镜像后你能得到一个合法字符)。
character | reverse | character | reverse | character | reverse |
---|---|---|---|---|---|
A | A | M | M | Y | Y |
B | N | Z | 5 | ||
C | O | O | 1 | 1 | |
D | P | 2 | S | ||
E | 3 | Q | 3 | E | |
F | R | 4 | |||
G | S | 2 | 5 | Z | |
H | H | T | T | 6 | |
I | I | U | U | 7 | |
J | L | V | V | 8 | 8 |
K | W | W | 9 | ||
L | J | X | X |
输入的每行包含一个字符串(保证只有上述字符,不含空白字符),判断它是否为回文串和镜像串(共四种组合)。每组数据之后输出一个空行。
样例输入:
NOTAPALINDROME
ISAPALINILAPASI
2A3MEAS
ATOYOTA
样例输出:
NOTAPALINDROME – is not a palindrom.
ISAPALINILAPASI – is a regular palindrome.
2A3MEAS – is a mirrored string.
ATOYOTA – is a mirrored palindrome.
#include <stdio.h>
#include <string.h>
#include <ctype.h>
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(scanf("%s", s) == 1) {
int len = strlen(s);
int p = 1, m = 1;
for (int i = 0; i < (len+1)/2; i++) {
if (s[i] != s[len-1-i])
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;
}