A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to right as when the string is read from right to left.
A mirrored string is a string for which when each of the elements of the string is changed to its reverse (if it has a reverse) and the string is read backwards the result is the same as the original string. For example, the string "3AIAE" is a mirrored string because "A" and "I" are their own reverses, and "3" and "E"are each others' reverses.
A mirrored palindrome is a string that meets the criteria of a regular palindrome and the criteria of a mirrored string. The string "ATOYOTA" is a mirrored palindrome because if the string is read backwards, the string is the same as the original and because if each of the characters is replaced by its reverse and the result is read backwards, the result is the same as the original string. Of course, "A", "T", "O", and "Y"are all their own reverses.
A list of all valid characters and their reverses is as follows.
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 |
Note that O (zero) and 0 (the letter) are considered the same character and therefore ONLY the letter "0" is a valid character.
STRING | CRITERIA |
" -- is not a palindrome." | if the string is not a palindrome and is not a mirrored string |
" -- is a regular palindrome." | if the string is a palindrome and is not a mirrored string |
" -- is a mirrored string." | if the string is not a palindrome and is a mirrored string |
" -- is a mirrored palindrome." | if the string is a palindrome and is a mirrored string |
Note that the output line is to include the -'s and spacing exactly as shown in the table above and demonstrated in the Sample Output below.
In addition, after each output line, you must print an empty line.
NOTAPALINDROME ISAPALINILAPASI 2A3MEAS ATOYOTA
NOTAPALINDROME -- is not a palindrome. ISAPALINILAPASI -- is a regular palindrome. 2A3MEAS -- is a mirrored string. ATOYOTA -- is a mirrored palindrome.
判断一个串是否是回文串和镜像串,然后根据不同的组合输出四种结果。回文串大家比较熟悉,注意fgets最后会读入一个回车,需要去除,关键是镜像串,其实大体意思就是一个图形在镜子中反射的形态,比如3和E,当然,只有大写字母才会出现这种情况。这里采取一种简单的思路,将所有字母数字的镜像存在数组中,然后设定一个映射,从而可以方便找到任何一个字母的镜像,再从后向前比较即可,注意的地方就是题目中不会输入空白字符。
#include <iostream> #include <stdio.h> #include <string.h> #define MAX 1000 using namespace std; char *dic="A###3##HIL#JM#O###2TUVWXY51SE#Z##8#";//镜像字典 int judge_pal(char *str)//判断是否是回文 { int len=strlen(str)-1; str[len]='\0'; //printf("len=%d",len); int i,j; for(i=0,j=len-1;i<=j;i++,j--) { if(str[i]!=str[j]) return 0; } return 1; } int judge_mir(char *str)//判断是否是镜像 { int len=strlen(str); int i,j; char temp; for(i=0,j=len-1;i<=j;i++,j--) { if(str[i]>='A'&&str[i]<='Z')//获取镜像 temp=dic[str[i]-'A']; else temp=dic[str[i]-23]; if(temp!=str[j]) return 0; } return 1; } void output(char *str,int pal_flag,int mir_flag)//输出 { if(pal_flag==0&&mir_flag==0) { printf("%s -- is not a palindrome.\n",str); } else if(pal_flag==1&&mir_flag==0) { printf("%s -- is a regular palindrome.\n",str); } else if(pal_flag==0&&mir_flag==1) { printf("%s -- is a mirrored string.\n",str); } else { printf("%s -- is a mirrored palindrome.\n",str); } printf("\n"); } int main() { char str[MAX]; int pal_flag,mir_flag; while(fgets(str,MAX,stdin)!=NULL) { pal_flag=judge_pal(str); mir_flag=judge_mir(str); output(str,pal_flag,mir_flag); } return 0; }