回文词和镜像串的判断

/*判断是否为回文串和镜像串（P42）*/
#include<stdio.h>
#include<string.h>
#include<ctype.h>

const char* rev = "A 3 HIL JM 0  2TUWXY51SE 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;//是否为回文数
        int 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;
}

 

  http://codepad.org/4f6Vxrk2