401 - Palindromes

最新推荐文章于 2024-04-29 22:18:42 发布

HackQ_sxj

最新推荐文章于 2024-04-29 22:18:42 发布

阅读量135

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/HackQ_sxj/article/details/88356734

版权

算法专栏收录该内容

37 篇文章 0 订阅

订阅专栏

#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'];
    else
        return rev[ch-'0'+25];
}

int main()
{
    char s[30];
    while(scanf("%s", s) != EOF)
    {
        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(s[i] != r(s[len-1-i])) m = 0;
        }
        printf("%s -- is %s.\n\n", s, msg[m*2+p]);
    }
    return 0;
}